IEEE Transactions on Information Theory
Channel coding rate in the finite blocklength regime
IEEE Transactions on Information Theory
| Hi-index | 754.96 |
We derive a new upper bound on the exponent of error probability of decoding for the best possible codes in the Gaussian channel. This bound is tighter than the known upper bounds (the sphere-packing and minimum-distance bounds proved in Shannon's classical 1959 paper and their low-rate improvement by Kabatiansky and Levenshtein (1978)). The proof is accomplished by studying asymptotic properties of codes on the sphere Sn-1(R). First we prove a general lower bound on the distance distribution of codes of large size. To derive specific estimates of the distance distribution, we study the asymptotic behavior of Jacobi polynomials Pkak, bk as k→∞. Since on the average there are many code vectors in the vicinity of the transmitted vector x, one can show that the probability of confusing x and one of these vectors cannot be too small. This proves a lower bound on the error probability of decoding and the upper bound announced in the title