Bounds for binary codes of length less than 25
- 1 January 1978
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 24 (1), 81-93
- https://doi.org/10.1109/tit.1978.1055827
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 areAKeywords
This publication has 37 references indexed in Scilit:
- Combining Independent Information in a Multivariate Calibration ProblemJournal of Multivariate Analysis, 1997
- An existence theory for pairwise balanced designs, III: Proof of the existence conjecturesJournal of Combinatorial Theory, Series A, 1975
- Minimum-distance bounds for binary linear codesIEEE Transactions on Information Theory, 1973
- An existence theory for pairwise balanced designs I. Composition theorems and morphismsJournal of Combinatorial Theory, Series A, 1972
- Upper bounds for constant weight error correcting codesDiscrete Mathematics, 1972
- On upper bounds for unrestricted binary-error-correcting codesIEEE Transactions on Information Theory, 1971
- Maximal and minimal coverings of (k− 1)-tuples byk-tuplesPacific Journal of Mathematics, 1968
- Two improved block codes (Corresp.)IEEE Transactions on Information Theory, 1965
- Improved asymptotic bounds for error-correcting codesIEEE Transactions on Information Theory, 1963
- A new upper bound for error-correcting codesIEEE Transactions on Information Theory, 1962