A new upper bound on the reliability function of the gaussian channel

IEEE Transactions on Information Theory

Volumn 46, Issue 6, 2000, Pages 1945-1961

  Ashikhmin, Alexei E ^a,b   Barg, Alexander ^d   Litsyn, Simon N ^a,b,c,d  

^a IEEE   (United States)

^b LOS ALAMOS NATIONAL LABORATORY   (United States)

^c LUCENT TECHNOLOGIES   (United States)

^d TEL AVIV UNIVERSITY   (Israel)

Author keywords

Distance distribution; Error probability of decoding; Jacobi polynomials; Spherical codes

Indexed keywords

CODING ERRORS; DECODING; POLYNOMIALS; PROBABILITY; SIGNAL ENCODING; VECTORS;

DISTANCE DISTRIBUTIONS; GAUSSIAN CHANNELS; JACOBI POLYNOMIALS; RELIABILITY FUNCTIONS; SPHERICAL CODES;

COMMUNICATION CHANNELS (INFORMATION THEORY);

EID: 0034270394     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.868471     Document Type: Article

References (37)

1. M. Aaltonen, Notes on the asymptotic behavior of the information rate of block codes, IEEE Trans. Inform. Theory, vol. IT-30, pp. 84-85, Jan. 1984.
2. M. J. Aaltonen, Linear programming bounds for tree codes, IEEE Trans. Inform. Theory, vol. IT-25, pp. 85-90, Jan. 1979.
3. A. Ashikhmin and A. Barg, Binomial moments of the distance distribution: Bounds and applications, IEEE Trans. Inform. Theory, vol. 45, pp. 438-452, Mar. 1999.
4. A. Ashikhmin, A. Barg, E. Knill, and S. Eitsyn, Quantum error detection, II, IEEE Trans. Inform. Theory, vol. 45, pp. 789-800, May 2000.
5. A. Ashikhmin, A. Barg, and S. Eitsyn, Polynomial method in coding and information theory," Eanl e-print, math.CO/9910175, 1999.
6. _, New bounds on generalized weights, IEEE Trans. Inform. Theory, vol. 45, pp. 1258-1263, May 1999.
7. _, A new upper bound on codes decodable into size-2 lists," in Numbers, Information and Complexity, I. Althöfer, Ed. Boston, MA: Kluwer, 2000, pp. 239-244.
8. A. Ashikhmin and S. Eitsyn, Upper bounds on the size of quantum codes" IEEE Trans. Inform. Theory, vol.45,pp. 1206-1215, May 1999.
9. M. V. Burnashev, On relation between code spectrum and decoding error probability, Probl. Inform. Transm., to be published.
10. E. Cartan, Sur la détermination d'un système orthogonal complet dans un espace de Riemann symmétrique clos, Rend. Cire. Mat. Palermo, vol. 53, pp. 217-252, 1929.
11. E.-C. Chen and M. E. H. Ismail, On asymptotics of Jacobi polynomials, SIAMJ. Math. Anal., vol. 22, no. 5, pp. 1442-1449, 1991.
12. J. H. Conway, R. H. Hardin, and N. J. A. Sloane, Packing lines, planes, etc.: Packings in Grassmannian spaces, Exper. Math., vol. 5, no. 2, pp. 139-159, 1996.
13. J. H. Conway and N. J. A. Sloane, Sphere Packings, Lattices and Groups. New York, NY/Berlin, Germany: Springer-Verlag, 1988.
14. P. Delsarte, An algebraic approach to the association schemes of coding theory, Philips Res. Repts. Suppl., vol. 10, pp. 1-97, 1973.
15. P. Delsarte, J. M. Goethals, and J. J. Seidel, Bounds for systems of lines and Jacobi polynomials, Philips Res. Repts., vol. 30, pp. 91*-105*, 1975.
16. _, Spherical codes and designs, Geometriae Dedicata, vol. 6, pp. 363-388, 1977.
17. A. Erdélyi, W. Magnus, F. Oberhettinger, and F. G. Tricomi, Higher Transcendental Functions. Vols. I-III (Bateman Manuscript Project). New York, NY/Toronto, Canada/Eondon, U.K.: McGraw-Hill, 1953-1955.
18. R. G. Gallager, Information Theory and Reliable Communication. New York: Wiley, 1968.
19. S.Helgason, Differential Geometry and Symmetric Spaces. New York: Academic, 1962.
20. E. Hewitt and K. A. Ross, Abstract Harmonic Analysis, Vol. II. New York: Springer, 1970.
21. G. Kabatyansky and V. I. Levenshtein, Bounds for packings on the sphere and in the space, Probl. Pered. Inform., vol. 14, no. 1, pp. 3-25, 1978.
22. G. Kalai and N. Linial, On the distance distribution of codes, IEEE Trans. Inform. Theory, vol. 41, pp. 1467-1472, Sept. 1995.
23. V. I. Levenshtein, Bounds for packings of metric spaces and some of their applications" (in Russian), Probl. Kibernet., pp. 43-110, 1983.
24. _, Method of nonnegative definite functions in metric problems of coding theory," Doctor of Science Dissertation (in Russian), Moscow, USSR, 1983.
25. S. Litsyn, New upper bounds on error exponents, IEEE Trans. Inform. Theory, vol. 45, pp. 385-398, Mar. 1999.
26. R. J. McEliece, E. R. Rodemich, H. Rumsey, and L. R. Welch, New upper bound on the rate of a code via the Delsarte-MacWilliams inequalities, IEEE Trans. Inform. Theory, vol. IT-23, pp. 157-166, Mar. 1977.
27. (αn,βn)(x), Trans. Amer. Math. Soc., vol. 249, no. 1, pp. 159-162, 1979.
28. P. M. Piret, Bounds for codes over the unit circle, IEEE Trans. Inform. Theory, vol. IT-31, pp. 760-767, Nov. 1986.
29. G. Sh. Poltyrev, Bounds on the decoding error probability of binary linear codes via their spectra, IEEE Trans. Inform. Theory, vol. 40, pp. 1284-1292, July 1994.
30. R. A. Rankin, The closest packing of spherical caps in n dimensions, Proc. Glasgow Math. Assoc., vol. 2, pp. 139-144, 1955.
31. C. E. Shannon, Probability of error for optimal codes in a Gaussian channel, Bell Syst. Tech. J., vol. 38, no. 3, pp. 611-656, 1959.
32. C. E. Shannon, R. G. Gallager, and E. R. Berlekamp, Lower bounds to error probability for codes on discrete memoryless channels-II, Inform. Contr., vol. 10, pp. 522-552, 1967.
33. A. Yu. Sheverdyaev, Decoding methods in channels with noise," Ph.D. dissertation (in Russian), Moscow, USSR, 1971.
34. D. Slepian, Group codes for the Gaussian channel, Bell Syst. Tech. J., vol. 47, pp. 575-602, 1968.
35. G. Szegö, Orthogonal polynomials," in Colloquium Publications. Providence, RI: Amer. Math. Soc., 1975.
36. N. Ja. Vilenkin and A. U. Klimyk, Representations of Lie Groups and Special Functions. Dordrecht, The Netherlands: Kluwer, 1991.
37. N. Ya. Vilenkin, Special Functions and the Theory of Group Representations. Providence, RI: Amer. Math. Soc., 1968.