A generalization of entropy equation: homogeneous entropies
A local structure of stationary perfectly noiseless codes between stationary non-ergodic sources. II. Applications
A local structure of stationary perfectly noiseless codes between stationary non-ergodic sources. III. Relative isomorphism of non-ergodic transformations
A local structure of stationary perfectly noiseless codes between stationary non-ergodic sources. I. General considerations
A simple proof for the existence of exponentially balanced Gray codes.
Alphabet-oriented and user-oriented source coding theories
Average convergence rate of the first return time
The convergence rate of the expectation of the logarithm of the first return time , after being properly normalized, is investigated for ergodic Markov chains. I. Kontoyiannis showed that for any β > 0 we have a.s. for aperiodic cases and A. J. Wyner proved that for any ε >0 we have eventually, a.s., where is the probability of the initial n-block in x. In this paper we prove that converges to a constant depending only on the process where is the modified first return time with...
Basic equations for source coding with side information at the decoder and encoder
Charakterisierung redundanzfreier codes zur datenverschlüsselung
Divergence between various estimates of quantized information sources
Epsilon-rates, epsilon-quantiles, and group coding theorems for finitely additive information sources
Gray codes in graphs
High-resolution quantization and entropy coding for fractional Brownian motion.
Information denoising and quantization by diffusion reaction model.
Note on Stochastic Transformers
On a coding theorem connected with ‘useful’ entropy of order and type
On the capacity of asymptotically mean stationary channels
On the error exponent for ergodic Markov source
On typical encodings of multivariate ergodic sources
We show that the typical coordinate-wise encoding of multivariate ergodic source into prescribed alphabets has the entropy profile close to the convolution of the entropy profile of the source and the modular polymatroid that is determined by the cardinalities of the output alphabets. We show that the proportion of the exceptional encodings that are not close to the convolution goes to zero doubly exponentially. The result holds for a class of multivariate sources that satisfy asymptotic equipartition...
Optimal quantization for the one–dimensional uniform distribution with Rényi--entropy constraints
We establish the optimal quantization problem for probabilities under constrained Rényi--entropy of the quantizers. We determine the optimal quantizers and the optimal quantization error of one-dimensional uniform distributions including the known special cases (restricted codebook size) and (restricted Shannon entropy).