Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Sign Up
Cited by 3,885

The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.

Channel Coding Rate in the Finite Blocklength Regime

Polyanskiy, Yury, Poor, H. Vincent, Verdu, Sergio·2010·IEEE Transactions on Information Theory
DOI 10.1109/tit.2010.2043769
Open this paper in CoChat — free account

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

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/tit.2010.2043769

Cites

1 of 1 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 1 references

Research works printed but not linked: 50

  1. elias, 1955, coding for two noisy channels, Proc 3rd London Symp Inf Theory, 61
  2. di, 2002, finite-length analysis of low-density parity-check codes on the binary erasure channel, IEEE Trans Inf Theory, 48, 1570, 10.1109/TIT.2002.1003839 · doi:10.1109/tit.2002.1003839
  3. 10.1109/ISIT.2008.4595291 · doi:10.1109/isit.2008.4595291
  4. 10.1109/ISIT.2009.5205312 · doi:10.1109/isit.2009.5205312
  5. strassen, 1962, asymptotische abschtzungen in shannon's informationstheorie, Trans 3rd Prague Conf Inf Theory, 689
  6. dobrushin, 1961, mathematical problems in the shannon theory of optimal coding of information, Proc 4th Berkeley Symp Math Statist Probabil, 1, 211
  7. 10.1109/18.737529 · doi:10.1109/18.737529
  8. 10.1109/TIT.1974.1055254 · doi:10.1109/tit.1974.1055254
  9. verd, 2007, EE528Information Theory Lecture Notes
  10. csiszr, 1967, information-type measures of difference of probability distributions and indirect observation, Studia Sci Math Hungar, 2, 229
  11. 10.1016/S0019-9958(67)90052-6 · doi:10.1016/s0019-9958(67)90052-6
  12. weiss, 1960, on the strong converse of the coding theorem for symmetric channels without memory, Quart Appl Math, 183
  13. 10.1109/18.335960 · DOI · Paper page
  14. 10.1109/ISIT.2007.4557074 · doi:10.1109/isit.2007.4557074
  15. ashikhmin, 2009, Personal communication
  16. ash, 1965, Information Theory
  17. thomasian, 1961, error bounds for continuous channels, Proc 4th London Symp Inf Theory, 46
  18. wolfowitz, 1962, Coding Theorems of Information Theory
  19. wolfowitz, 1957, the coding of messages subject to chance errors, Illinois J Math, 1, 591, 10.1215/ijm/1255380682 · DOI
  20. 10.1109/18.476322 · doi:10.1109/18.476322
  21. 10.1016/S0019-9958(68)90112-5 · doi:10.1016/s0019-9958(68)90112-5
  22. 10.1109/ISIT.2009.5205838 · doi:10.1109/isit.2009.5205838
  23. shannon, 0, Claude Elwood Shannon's Papers
  24. 10.1109/TIT.2007.903156 · doi:10.1109/tit.2007.903156
  25. 10.1109/TIT.2008.920216 · DOI
  26. feller, 1971, An Introduction to Probability Theory and Its Applications, ii
  27. 10.1109/18.868471 · doi:10.1109/18.868471
  28. 10.1109/TIT.1954.1057459 · DOI
  29. 10.1016/S0019-9958(57)90039-6 · doi:10.1016/s0019-9958(57)90039-6
  30. 10.1109/TIT.1965.1053730 · DOI · Paper page
  31. gallager, 1968, Information Theory and Reliable Communication
  32. 10.1109/18.335935 · doi:10.1109/18.335935
  33. 10.1109/TIT.2002.800480 · DOI
  34. 10.1109/18.556112 · doi:10.1109/18.556112
  35. 10.1002/j.1538-7305.1963.tb04013.x · DOI
  36. 10.1002/j.1538-7305.1959.tb03905.x · DOI · Paper page
  37. salema, 2002, Microwave Radio Links From Theory to Design
  38. dolinar, 1998, Code Performance as a Function of Block Size
  39. 10.1109/TIT.2004.838090 · doi:10.1109/tit.2004.838090
  40. 10.1109/ACSSC.2004.1399310 · doi:10.1109/acssc.2004.1399310
  41. 10.1109/MPC.1994.311827 · doi:10.1109/mpc.1994.311827
  42. 10.1109/ISIT.1998.708841 · doi:10.1109/isit.1998.708841
  43. 10.1007/BF00531753 · doi:10.1007/bf00531753
  44. 10.1137/1113063 · doi:10.1137/1113063
  45. 10.1109/CISS.2008.4558558 · doi:10.1109/ciss.2008.4558558
  46. 10.1109/TIT.2009.2030478 · doi:10.1109/tit.2009.2030478
  47. 10.1007/978-1-4757-2341-0 · DOI · Paper page
  48. 10.1007/BF00536558 · DOI
  49. jones, 1968, an extension of inequality involving modified bessel functions, J Math Phys, 47, 220, 10.1002/sapm1968471220 · doi:10.1002/sapm1968471220
  50. abramowitz, 1972, Handbook of Mathematical Functions with Formulas Graphs and Mathematical Tables

Cited by

See all 3,885

Metadata

Authors
Polyanskiy, Y., Poor, H. V., & Verdu, S.
Venue
IEEE Transactions on Information Theory
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Published
2010-05
Volume
56
Issue
5
Pages
2307-2359
ISSN
  • 0018-9448 (ISSN-L)
  • 1557-9654
DOI
10.1109/tit.2010.2043769
OpenAlex
W2106864314
Cited by
3,885
References
1
FWCI
110.77
Type
journal article
Language
en
Open access
closed
Licence
ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html (vor)

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Channel Coding Rate in the Finite Blocklength Regime. https://app.cochat.ai/papers/10.1109/tit.2010.2043769
The paper
Polyanskiy, Y., Poor, H. V., & Verdu, S. (2010). Channel Coding Rate in the Finite Blocklength Regime. IEEE Transactions on Information Theory. https://doi.org/10.1109/tit.2010.2043769

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.