NASA Logo

NTRS

NTRS - NASA Technical Reports Server

Collections About News Help Login
Back to Results
New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalitiesAn upper bound on the rate of a binary code as a function of minimum code distance (using a Hamming code metric) is arrived at from Delsarte-MacWilliams inequalities. The upper bound so found is asymptotically less than Levenshtein's bound, and a fortiori less than Elias' bound. Appendices review properties of Krawtchouk polynomials and Q-polynomials utilized in the rigorous proofs.
Document ID
19770046204
Acquisition Source
Legacy CDMS
Document Type
Reprint (Version printed in journal)
Authors
Mceliece, R. J. (Jet Propulsion Lab., California Inst. of Tech. Pasadena, CA, United States)
Rodemich, E. R. (Jet Propulsion Lab., California Inst. of Tech. Pasadena, CA, United States)
Rumsey, H., Jr. (California Institute of Technology, Jet Propulsion Laboratory, Pasadena Calif., United States)
Welch, L. R. (Southern California, University Los Angeles, Calif., United States)
Date Acquired
August 8, 2013
Publication Date
March 1, 1977
Publication Information
Publication: IEEE Transactions on Information Theory
Volume: IT-23
Subject Category
Cybernetics
Accession Number
77A29056
Funding Number(s)
CONTRACT_GRANT: NAS7-100
Distribution Limits
Public
Copyright
Other

Available Downloads

There are no available downloads for this record.

Related Records

There are no records associated with this record.
No Preview Available