Bounds for binary codes of length less than 25

Authors:
M. Best;A. Brouwer;F. MacWilliams;A. Odlyzko;N. Sloane
Affiliations:
-;-;-;-;-
Venue:
IEEE Transactions on Information Theory
Year:
2006

Citing 0
Cited 1

Improving the resilience of content distribution networks to large scale distributed denial of service attacks

Computer Networks: The International Journal of Computer and Telecommunications Networking

Quantified Score

Hi-index	754.84

Visualization

Abstract

Improved bounds forA(n,d), the maximum number of codewords in a (linear or nonlinear) binary code of word lengthnand minimum distanced, and forA(n,d,w), the maximum number of binary vectors of lengthn, distanced, and constant weightwin the rangen leq 24andd leq 10are presented. Some of the new values areA