IEEE Transactions on Information Theory · 1977 · 455 citations · 5 references
EngineeringComputer ScienceMathematicsInformation TheoryChannel CapacityChannel CodingCoding TheoryError-correcting CodesBounds On CodesCode BoundsHamming DistanceLower BoundsMinimum DistanceMinimum Distance BoundsUpper Bounds
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.
5
A low-rate improvement on the Elias bound
L. R. Welch, Robert J. McEliece, Howard Rumsey · 1974 · 13 citations