Channel coding rate in the finite blocklength regime

Authors:
Yury Polyanskiy;H. Vincent Poor;Sergio Verdú
Affiliations:
Department of Electrical Engineering, Princeton University, Princeton, NJ;Department of Electrical Engineering, Princeton University, Princeton, NJ;Department of Electrical Engineering, Princeton University, Princeton, NJ
Venue:
IEEE Transactions on Information Theory
Year:
2010

Citing 16
Cited 4

An introduction to signal detection and estimation (2nd ed.)

An introduction to signal detection and estimation (2nd ed.)
Coding Theorems of Information Theory

Coding Theorems of Information Theory
Information Theory and Reliable Communication

Information Theory and Reliable Communication
Microwave Radio Links: From Theory to Design

Microwave Radio Links: From Theory to Design
Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,

Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,
Dispersion of the Gilbert-Elliott channel

ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
Information spectrum approach to second-order coding rate in channel coding

IEEE Transactions on Information Theory
A lower bound on the probability of error in multihypothesis testing

IEEE Transactions on Information Theory - Part 2
On the information function of an error-correcting code

IEEE Transactions on Information Theory
A comparison of known codes, random codes, and the best codes

IEEE Transactions on Information Theory
A new upper bound on the reliability function of the Gaussian channel

IEEE Transactions on Information Theory
Finite-length analysis of low-density parity-check codes on the binary erasure channel

IEEE Transactions on Information Theory
Random codes: minimum distances and error exponents

IEEE Transactions on Information Theory
Sphere-packing bounds revisited for moderate block lengths

IEEE Transactions on Information Theory
A Study on Universal Codes With Finite Block Lengths

IEEE Transactions on Information Theory
An Improved Sphere-Packing Bound for Finite-Length Codes Over Symmetric Memoryless Channels

IEEE Transactions on Information Theory

Dispersion of Gaussian channels

ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
Dispersion of the Gilbert-Elliott channel

ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
Rateless spinal codes

Proceedings of the 10th ACM Workshop on Hot Topics in Networks
Real-time redundancy allocation for time-varying underwater acoustic channels

Proceedings of the Seventh ACM International Conference on Underwater Networks and Systems

Quantified Score

Hi-index	754.84

Visualization

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 ε is closely approximated by C - √V/nQ-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.