CaltechAUTHORS
Published March 1977 | Version Published
Journal Article Open

New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities

Creators

Abstract

With the Delsarte-MacWilliams inequalities as a starting point, an upper bound is obtained on the rate of a binary code as a function of its minimum distance. This upper bound is asymptotically less than Levenshtein's bound, and so also Elias's.

Additional Information

© 1977 IEEE. Reprinted with permission. Manuscript received April 19, 1976. This paper presents the results of one phase of research carried out at the Jet Propulsion Laboratory, California Institute of Technology, under Contract No. NAS 7-100, sponsored by the National Aeronautics and Space Administration. The authors wish to thank Philippe Delsarte, Andrew Odlyzko, and Neil Sloane for their helpful comments on this paper.

Attached Files

Published - MCEieeetit77a.pdf

Files

MCEieeetit77a.pdf

Files (943.8 kB)

Name Size
md5:eb8b57ed8abb61284284d6ec300abe8e
943.8 kB Preview Download

Additional details

Identifiers

Eprint ID
6934
Resolver ID
CaltechAUTHORS:MCEieeetit77a

Related works

Describes
http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=22695&arnumber=1055688&count=23&index=9 (URL)

Funding

NASA/JPL/Caltech
NAS 7-100

Dates

Created
2007-01-03
Created from EPrint's datestamp field
Updated
2021-11-08
Created from EPrint's last_modified field