The DOI matches its Crossref record; 27 of the 27 references it cites were found in a registry or an index.
Channel Coding Rate in the Finite Blocklength Regime
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.
Integrity signals
Registry
Cites
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.
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
A Mathematical Theory of Communication
Shannon, C. E. (1948) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1948.tb01338.x · Cited by 88,486
An introduction to probability theory and its applications
(1958) · Journal of the Franklin Institute · doi:10.1016/0016-0032(58)90688-4 · Cited by 29,269
Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables
W., J. W., Abramowitz, M., & Stegun, I. A. (1965) · Mathematics of Computation · doi:10.2307/2004114 · Cited by 18,663
Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables
Owen, D. B., Abramowitz, M., & Stegun, I. A. (1965) · Technometrics · doi:10.2307/1266136 · Cited by 16,138
Information Theory and Reliable Communication.
Lee, P. M., & Gallager, R. T. (1970) · Journal of the Royal Statistical Society. Series A (General) · doi:10.2307/2344305 · Cited by 5,399
An Introduction to Probability Theory and its Applications.
Kingman, J. F. C., & Feller, W. (1972) · Journal of the Royal Statistical Society. Series A (General) · doi:10.2307/2344620 · Cited by 4,938
Handbook of Mathematical Functions with Formulas
Owen, D. B. (1965) · Technometrics · doi:10.1080/00401706.1965.10490234 · Cited by 4,021
Information Theory and Reliable Communication
Bell, D. A. (1969) · Electronics and Power · doi:10.1049/ep.1969.0319 · Cited by 4,012
ASH, R. B. (1966) · Cited by 3,990
Jacob, M. (1989) · Health Education Journal · doi:10.1177/001789698904800401 · Cited by 3,090
An Introduction to Signal Detection and Estimation
Poor, H. V. (1994) · Springer Texts in Electrical Engineering · doi:10.1007/978-1-4757-2341-0 · Cited by 2,659
Self-citationInformation-type measures of difference of probability distributions and indirect observation
Csiszár, I. (1967) · Studia Scientiarum Mathematicarum Hungarica · Cited by 1,332
An introduction to signal detection and estimation (2nd ed.)
Poor, H. V. (1994) · Springer eBooks · Cited by 1,008
Self-citationProbability of Error for Optimal Codes in a Gaussian Channel
Shannon, C. E. (1959) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1959.tb03905.x · Cited by 807
A general formula for channel capacity
Verdu, S., & Han, T. S. (1994) · IEEE Transactions on Information Theory · doi:10.1109/18.335960 · Cited by 779
Self-citationA simple derivation of the coding theorem and some applications
Gallager, R. (1965) · IEEE Transactions on Information Theory · doi:10.1109/tit.1965.1053730 · Cited by 687
Coding Theorems of Information Theory
Wolfowitz, J. (1978) · Springer eBooks · doi:10.1007/978-3-642-66822-7 · Cited by 391
Lower bounds to error probability for coding on discrete memoryless channels. II
Shannon, C. E., Gallager, R. G., & Berlekamp, E. R. (1967) · Information and Control · doi:10.1016/s0019-9958(67)91200-4 · Cited by 384
Random codes: minimum distances and error exponents
Barg, A., & Forney, G. D. (2002) · IEEE Transactions on Information Theory · doi:10.1109/tit.2002.800480 · Cited by 248
A new basic theorem of information theory
Feinstein, A. (1954) · Transactions of the IRE Professional Group on Information Theory · doi:10.1109/tit.1954.1057459 · Cited by 245
The coding of messages subject to chance errors
Wolfowitz, J. (1957) · Illinois Journal of Mathematics · doi:10.1215/ijm/1255380682 · Cited by 162
An application of Fourier methods to the problem of sharpening the Berry-Esseen inequality
Beek, P. (1972) · Probability Theory and Related Fields · doi:10.1007/bf00536558 · Cited by 160
Coding Theorems of Information Theory.
Good, I. J., & Wolfowitz, J. (1962) · Journal of the Royal Statistical Society. Series A (General) · doi:10.2307/2982637 · Cited by 158
Dispersion of the Gilbert-Elliott Channel
Polyanskiy, Y., Poor, H. V., & Verdú, S. (2011) · IEEE Transactions on Information Theory · doi:10.1109/tit.2011.2111070 · Cited by 102
Self-citationAn Improved Sphere-Packing Bound for Finite-Length Codes Over Symmetric Memoryless Channels
Wiechman, G., & Sason, I. (2008) · IEEE Transactions on Information Theory · doi:10.1109/tit.2008.920216 · Cited by 77
Slepian, D. (1963) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1963.tb04013.x · Cited by 65
Mathematical Problems in the Shannon Theory of Optimal Coding of Information
Dobrushin, R. L. (1961) · Project Euclid (Cornell University) · Cited by 49
Research works printed but not linked: 33
- elias, 1955, coding for two noisy channels, Proc 3rd London Symp Inf Theory, 61
- 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
- 10.1109/ISIT.2008.4595291 · doi:10.1109/isit.2008.4595291
- 10.1109/ISIT.2009.5205312 · doi:10.1109/isit.2009.5205312
- strassen, 1962, asymptotische abschtzungen in shannon's informationstheorie, Trans 3rd Prague Conf Inf Theory, 689
- 10.1109/18.737529 · doi:10.1109/18.737529
- 10.1109/TIT.1974.1055254 · doi:10.1109/tit.1974.1055254
- verd, 2007, EE528Information Theory Lecture Notes
- 10.1016/S0019-9958(67)90052-6 · doi:10.1016/s0019-9958(67)90052-6
- weiss, 1960, on the strong converse of the coding theorem for symmetric channels without memory, Quart Appl Math, 183
- 10.1109/ISIT.2007.4557074 · doi:10.1109/isit.2007.4557074
- ashikhmin, 2009, Personal communication
- thomasian, 1961, error bounds for continuous channels, Proc 4th London Symp Inf Theory, 46
- 10.1109/18.476322 · doi:10.1109/18.476322
- 10.1016/S0019-9958(68)90112-5 · doi:10.1016/s0019-9958(68)90112-5
- 10.1109/ISIT.2009.5205838 · doi:10.1109/isit.2009.5205838
- shannon, 0, Claude Elwood Shannon's Papers
- 10.1109/TIT.2007.903156 · doi:10.1109/tit.2007.903156
- 10.1109/18.868471 · doi:10.1109/18.868471
- 10.1016/S0019-9958(57)90039-6 · doi:10.1016/s0019-9958(57)90039-6
- 10.1109/18.335935 · doi:10.1109/18.335935
- 10.1109/18.556112 · doi:10.1109/18.556112
- salema, 2002, Microwave Radio Links From Theory to Design
- dolinar, 1998, Code Performance as a Function of Block Size
- 10.1109/TIT.2004.838090 · doi:10.1109/tit.2004.838090
- 10.1109/ACSSC.2004.1399310 · doi:10.1109/acssc.2004.1399310
- 10.1109/MPC.1994.311827 · doi:10.1109/mpc.1994.311827
- 10.1109/ISIT.1998.708841 · doi:10.1109/isit.1998.708841
- 10.1007/BF00531753 · doi:10.1007/bf00531753
- 10.1137/1113063 · doi:10.1137/1113063
- 10.1109/CISS.2008.4558558 · doi:10.1109/ciss.2008.4558558
- 10.1109/TIT.2009.2030478 · doi:10.1109/tit.2009.2030478
- jones, 1968, an extension of inequality involving modified bessel functions, J Math Phys, 47, 220, 10.1002/sapm1968471220 · doi:10.1002/sapm1968471220
Cited by
In-Band Full-Duplex Wireless: Challenges and Opportunities
Sabharwal, A., Schniter, P., Guo, D., Bliss, D. W., Rangarajan, S., & Wichman, R. (2014) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2014.2330193 · Cited by 2,290
Massive MIMO Networks: Spectral, Energy, and Hardware Efficiency
Björnson, E., Hoydis, J., & Sanguinetti, L. (2017) · Foundations and Trends® in Signal Processing · doi:10.1561/2000000093 · Cited by 2,137
Towards 6G wireless communication networks: vision, enabling technologies, and new paradigm shifts
You, X., Wang, C.-X., Huang, J., Gao, X., Zhang, Z., Wang, M., Huang, Y., Zhang, C., Jiang, Y., Wang, J., et al. (2021) · Science China Information Sciences · doi:10.1007/s11432-020-2955-6 · Cited by 2,027
Self-citationTal, I., & Vardy, A. (2015) · IEEE Transactions on Information Theory · doi:10.1109/tit.2015.2410251 · Cited by 1,820
6G Wireless Systems: Vision, Requirements, Challenges, Insights, and Opportunities
Tataria, H., Shafi, M., Molisch, A. F., Dohler, M., Sjöland, H., & Tufvesson, F. (2021) · Proceedings of the IEEE · doi:10.1109/jproc.2021.3061701 · Cited by 1,549
Metadata
- Authors
- Polyanskiy, Y., Poor, H. V., & Verdu, S.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2010-05
- Volume
- 56
- Issue
- 5
- Pages
- 2307-2359
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W2106864314
- Cited by
- 3,885
- References
- 27
- FWCI
- 110.77
- Type
- journal article
- Language
- en
- Open access
- closed
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
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.