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

Authors:
R. McEliece;E. Rodemich;H. Rumsey;L. Welch
Affiliations:
-;-;-;-
Venue:
IEEE Transactions on Information Theory
Year:
2006

Citing 0
Cited 5

List decoding algorithms for certain concatenated codes

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Dense packings from quadratic fields and codes

Journal of Combinatorial Theory Series A
Commutative association schemes

European Journal of Combinatorics
Covering and radius-covering arrays: Constructions and classification

Discrete Applied Mathematics
Note on the size of binary Armstrong codes

Designs, Codes and Cryptography

Quantified Score

Hi-index	754.84

Visualization

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.