Spectral approach to linear programming bounds on codes

Problems of Information Transmission

Volumn 42, Issue 2, 2006, Pages 77-89

  Barg, A M ^a,b   Nogin, D Yu ^a  

^a INSTITUTE FOR INFORMATION TRANSMISSION PROBLEMS   (Russian Federation)

^b UNIVERSITY OF MARYLAND   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY CODES; EIGENVALUES AND EIGENFUNCTIONS; LINEAR PROGRAMMING; MATHEMATICAL OPERATORS; POLYNOMIAL APPROXIMATION; SPECTRUM ANALYSIS;

ASYMPTOTIC UPPER BOUNDS; DELSARTE'S LINEAR PROGRAMMING; ORTHOGONAL POLYNOMIALS; SPHERICAL CODES;

SIGNAL ENCODING;

EID: 33745850459     PISSN: 00329460     EISSN: 16083253     Source Type: Journal    
DOI: 10.1134/S0032946006020025     Document Type: Article

References (11)

1. Delsarte, P., An Algebraic Approach to the Association Schemes of Coding Theory, Philips Res. Rep. Suppl., 1973, no. 10.
2. McEliece, R.J., Rodemich, E.R., Rumsey, H., Jr., and Welch, L.R., New Upper Bounds on the Rate of a Code via the Delsarte-MacWilliams Inequalities, IEEE Trans. Inform. Theory, 1977, vol. 23, no. 2, pp. 157-166.
3. Kabatianski, G.A. and Levenshtein, V.I., Bounds for Packings on a Sphere and in Space, Probl. Peredachi Inf., 1978, vol. 14, no. 1, pp. 3-25 [Probl. Inf. Trans. (Engl. Transl.), 1978, vol. 14, no. 1, pp. 1-17].
4. Levenshtein, V.I., Bounds on Packings of Metric Spaces and Some of Their Applications, Probl. Kibern., 1983, vol. 40, pp. 43-110.
5. Levenshtein, V.I., Universal Bounds for Codes and Designs, Handbook of Coding Theory, Pless, V.S. and Huffman, W.C., Eds., Amsterdam: Elsevier, 1998, vol. I, pp. 499-648.
6. Bachoc, C., Linear Programming Bounds for Codes in Grassmannian Spaces, IEEE Trans. Inform. Theory, 2006, vol. 52, no. 5, pp. 2111-2125.
7. Szegö, G., Orthogonal Polynomials, New York: AMS, 1959. Translated under the title Ortogonal'nye mnogochleny, Moscow: Fizmatlit, 1962.
8. Gantmakher, F.R., Teoriya matrits, Moscow: Nauka, 1988, 4th ed. Translated under the title The Theory of Matrices, 2 vols., Providence: AMS Chelsea, 1998.
9. Ismail, M.E. and Li, X., Bound on the Extremal Zeros of Orthogonal Polynomials, Proc. AMS, 1992, vol. 113, no. 1, pp. 131-140.
10. Levenshtein, V.I., Krawtchouk Polynomials and Universal Bounds for Codes and Designs in Hamming Spaces, IEEE Trans. Inform. Theory, 1995, vol. 41, no. 5, pp. 1303-1321.
11. Foster, W.H. and Krasikov, I., Bounds for the Extreme Roots of Orthogonal Polynomials, Int. J. Math. Algorithms, 2000, vol. 2, pp. 121-132.