TY - JOUR
T1 - Bounds for binary codes of length less than 25
AU - Best, M.R.
AU - Brouwer, A.E.
AU - MacWilliams, F.J.
AU - Odlyzko, A.M.
AU - Sloane, N.J.A.
PY - 1978
Y1 - 1978
N2 - 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
AB - 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
U2 - 10.1109/TIT.1978.1055827
DO - 10.1109/TIT.1978.1055827
M3 - Article
SN - 0018-9448
VL - 24
SP - 81
EP - 93
JO - IEEE Transactions on Information Theory
JF - IEEE Transactions on Information Theory
IS - 1
ER -