Pseudorandom encoding with quantized real modulation values encodes only continuous real-valued functions. However, an arbitrary complex value can be represented if the desired value is first mapped to the closest real value realized by use of pseudorandom encoding. Examples of encoding real- and complex-valued functions illustrate performance improvements over conventional minimum distance map...

Given a real-valued continuous function defined on n-dimensional Euclidean space, we construct a Khalimsky-continuous integer-valued approximation. From a geometrical point of view, this digitization takes a hypersurface that is the graph of a function and produces a digital hypersurface—the graph of the digitized function.

It is well-known that the sum of two $z$-ideals in $C(X)$ is either $C(X)$ or a $z$-ideal. The main aim of this paper is to study the sum of strongly $z$-ideals in ${mathcal{R}} L$, the ring of real-valued continuous functions on a frame $L$. For every ideal $I$ in ${mathcal{R}} L$, we introduce the biggest strongly $z$-ideal included in $I$ and the smallest strongly $z$-ideal containing ...