Upper bounds on the reliability function of the Gaussian channel were derived by Shannon in 1959 . Kabatiansky and Levenshtein  obtained a low-rate improvement of Shannon's "minimum-distance bound". Together with the straight-line bound this provided an improvement upon the sphere-packing bound in a certain range of code rate. In this work we prove a bound better than the KL bound on the reliability function. Employing the straight-line bound, we obtain a further improvement of Shannon's results. As intermediate results we prove lower bounds on the distance distribution of spherical codes and a tight bound on the exponent of Jacobi polynomials of growing degree in the entire orthogonality segment.
|Number of pages||1|
|Journal||IEEE International Symposium on Information Theory - Proceedings|
|State||Published - 2000|
|Event||2000 IEEE International Symposium on Information Theory - Serrento, Italy|
Duration: 25 Jun 2000 → 30 Jun 2000