An updated table of minimum-distance bounds for binary linear codes
- 1 March 1993
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 39 (2) , 662-677
- https://doi.org/10.1109/18.212301
Abstract
Tables with lower and upper bounds for dmax ( n,k), the maximum possible minimum distance of a binary linear code with word length n and dimension k, are shownKeywords
This publication has 53 references indexed in Scilit:
- Binary Perfect Codes of Length 15 by the Generalized Concatenated ConstructionProblems of Information Transmission, 2004
- Some ternary and quaternary codes and associated sphere packingsIEEE Transactions on Information Theory, 1992
- There is no binary (25,8,10) codeIEEE Transactions on Information Theory, 1990
- The concatenated structure of cyclic and Abelian codesIEEE Transactions on Information Theory, 1985
- A [55,16,19] binary Goppa code (Corresp.)IEEE Transactions on Information Theory, 1984
- On upper bounds for unrestricted binary-error-correcting codesIEEE Transactions on Information Theory, 1971
- Some Remarks on BCH Bounds and Minimum Weights of Binary Primitive BCH CodesIEEE Transactions on Information Theory, 1969
- New binary coding results by circulantsIEEE Transactions on Information Theory, 1969
- Polynomial codesIEEE Transactions on Information Theory, 1968
- A new upper bound for error-correcting codesIEEE Transactions on Information Theory, 1962