New Upper Bounds on the Rate of a Code via the Delsarte—MacWilliams Inequalities

IEEE Transactions on Information Theory

Volumn IT-23, Issue 2, 1977, Pages 157-166

  McEliece, Robert J ^a   Rodemich, Eugene R ^a   Rumsey, Howard ^a   Welch, Lloyd R ^b  

^a CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

^b UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY CODES;

CODES, SYMBOLIC;

EID: 0017468074     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/TIT.1977.1055688     Document Type: Article

References (8)

1. R. Askey, Orthogonal Polynomials and Special Functions. (vol. 21 in SIAM's Regional Conference Lectures in Applied Math.) Philadelphia: SIAM, 1975.
2. E. R. Berlekamp, Algebraic Coding Theory. New York: McGraw-Hill, 1968.
3. P. Delsarte, An Algebraic Approach to the Association Schemes of Coding Theory. Eindhoven: Philips Research Reports Supplements no. 10, 1973.
4. S. Karlin and J. L. McGregor, “The Hahn polynomials, formulas, and an application,” Scripta Mathematica, vol. 26, pp. 33–46, 1961.
5. V. I. Levenshtein, “On the minimal redundancy of binary error-correcting codes” (in Russian), Problemy Peredachi Informatsii, vol. 10, pp. 26–42, 1974. (English translation in Information and Control, vol. 28, pp. 268–291, 1975.)
6. V. M. Sidelnikov., “Upper bounds on the cardinality of a binary code with a given minimum distance” (in Russian), Problemy Peredachi Informatsii, vol. 10, pp. 43–51, 1974. (English translation in Information and Control, vol. 28, pp. 292–303, 1975.
7. G. Szego, Orthogonal Polynomials. Providence: American Mathematical Society, 1939.
8. L. R. Welch, R. J. McEliece, and H. Rumsey, Jr., “A low-rate improvement on the Elias bound,” IEEE Trans. Inform. Theory, vol. IT-20, pp. 676–678, Sept. 1974.