Channel Coding Rate in the Finite Blocklength Regime
Top Cited Papers
- 19 April 2010
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 56 (5) , 2307-2359
- https://doi.org/10.1109/tit.2010.2043769
Abstract
This paper investigates the maximal channel coding rate achievable at a given blocklength and error probability. For general classes of channels new achievability and converse bounds are given, which are tighter than existing bounds for wide ranges of parameters of interest, and lead to tight approximations of the maximal achievable rate for blocklengths n as short as 100. It is also shown analytically that the maximal rate achievable with error probability ¿ isclosely approximated by C - ¿(V/n) Q-1(¿) where C is the capacity, V is a characteristic of the channel referred to as channel dispersion , and Q is the complementary Gaussian cumulative distribution function.Keywords
This publication has 35 references indexed in Scilit:
- Sphere-Packing Bounds Revisited for Moderate Block LengthsIEEE Transactions on Information Theory, 2004
- Random codes: minimum distances and error exponentsIEEE Transactions on Information Theory, 2002
- A new upper bound on the reliability function of the Gaussian channelIEEE Transactions on Information Theory, 2000
- A comparison of known codes, random codes, and the best codesIEEE Transactions on Information Theory, 1998
- On the information function of an error-correcting codeIEEE Transactions on Information Theory, 1997
- A lower bound on the probability of error in multihypothesis testingIEEE Transactions on Information Theory, 1995
- A general formula for channel capacityIEEE Transactions on Information Theory, 1994
- Bounds on the decoding error probability of binary linear codes via their spectraIEEE Transactions on Information Theory, 1994
- Hypothesis testing and information theoryIEEE Transactions on Information Theory, 1974
- A simple derivation of the coding theorem and some applicationsIEEE Transactions on Information Theory, 1965