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).