Empirical Distribution of Good Channel Codes With Nonvanishing Error Probability
Authors:
- 4 October 2013
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 60 (1) , 5-21
Abstract
This paper studies several properties of channel codes that approach the fundamental limits of a given (discrete or Gaussian) memoryless channel with a nonvanishing probability of error. The output distribution induced by an ϵ-capacity-achieving code is shown to be close in a strong sense to the capacity achieving output distribution. Relying on the concentration of measure (isoperimetry) property enjoyed by the latter, it is shown that regular (Lipschitz) functions of channel outputs can be precisely estimated and turn out to be essentially nonrandom and independent of the actual code. It is also shown that the output distribution of a good code and the capacity achieving one cannot be distinguished with exponential reliability. The random process produced at the output of the channel is shown to satisfy the asymptotic equipartition property.Keywords
All Related Versions
This publication has 28 references indexed in Scilit:
- Concentration of the information in data with log-concave distributionsThe Annals of Probability, 2011
- Discrete isoperimetric and Poincaré-type inequalitiesProbability Theory and Related Fields, 1999
- Concentration of measure and logarithmic Sobolev inequalities1999
- The role of the asymptotic equipartition property in noiseless source codingIEEE Transactions on Information Theory, 1997
- The empirical distribution of good codesIEEE Transactions on Information Theory, 1997
- Bounding $\bar{d}$-distance by informational divergence: a method to prove measure concentrationThe Annals of Probability, 1996
- Isoperimetry and Gaussian analysis1996
- A lower bound on the probability of error in multihypothesis testingIEEE Transactions on Information Theory, 1995
- An Isoperimetric Theorem on the Cube and the Kintchine-Kahane InequalitiesProceedings of the American Mathematical Society, 1988
- A simple proof of the blowing-up lemma (Corresp.)IEEE Transactions on Information Theory, 1986