@inproceedings{9956a90ecb64456cac840e24e01aa37d,
title = "A new upper bound on the reliability function of the Gaussian channel",
abstract = "Upper bounds on the reliability function of the Gaussian channel were derived by Shannon in 1959. Kabatiansky and Levenshtein (1978) 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.",
author = "A. Ashikhmin and A. Barg and S. Litsyn",
note = "Publisher Copyright: {\textcopyright} 1999 IEEE.; 1999 IEEE Information Theory and Communications Workshop ; Conference date: 25-06-1999",
year = "1999",
doi = "10.1109/ITCOM.1999.781434",
language = "אנגלית",
series = "Proceedings of the 1999 IEEE Information Theory and Communications Workshop",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "103",
editor = "Francis Swarts and Jacobus Swarts",
booktitle = "Proceedings of the 1999 IEEE Information Theory and Communications Workshop",
address = "ארצות הברית",
}