Title :
New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities
Author :
Mceliece, Robert J. ; Rodemich, Eugene R. ; Rumsey, Howard ; Welch, Lloyd R.
fDate :
3/1/1977 12:00:00 AM
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.
Keywords :
Coding; Binary codes; Hamming weight; Information theory; Laboratories; Propulsion; Space technology; Upper bound;
Journal_Title :
Information Theory, IEEE Transactions on
DOI :
10.1109/TIT.1977.1055688
