Bounds for binary codes of length less than 25

M.R. Best; A.E. Brouwer; F.J. MacWilliams; A.M. Odlyzko; N.J.A. Sloane

doi:10.1109/TIT.1978.1055827

Bounds for binary codes of length less than 25

M.R. Best
, A.E. Brouwer
, F.J. MacWilliams
, A.M. Odlyzko
, N.J.A. Sloane

Research output: Contribution to journal › Article › Academic › peer-review

108 Citations (Scopus)

1 Downloads (Pure)

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

Original language	English
Pages (from-to)	81-93
Journal	IEEE Transactions on Information Theory
Volume	24
Issue number	1
DOIs	https://doi.org/10.1109/TIT.1978.1055827
Publication status	Published - 1978

Access to Document

10.1109/TIT.1978.1055827

Cite this

@article{24bd419a7c314b74968a679d882a116f,

title = "Bounds for binary codes of length less than 25",

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",

author = "M.R. Best and A.E. Brouwer and F.J. MacWilliams and A.M. Odlyzko and N.J.A. Sloane",

year = "1978",

doi = "10.1109/TIT.1978.1055827",

language = "English",

volume = "24",

pages = "81--93",

journal = "IEEE Transactions on Information Theory",

issn = "0018-9448",

publisher = "Institute of Electrical and Electronics Engineers",

number = "1",

}

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 -

Bounds for binary codes of length less than 25

Abstract

Access to Document

Fingerprint

Cite this