A sharpening of the Johnson bound for binary linear codes and the nonexistence of linear codes with preparata parameters
- 1 May 1993
- journal article
- Published by Springer Science and Business Media LLC in Designs, Codes and Cryptography
- Vol. 3 (2), 95-98
- https://doi.org/10.1007/bf01388407
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- An updated table of minimum-distance bounds for binary linear codesIEEE Transactions on Information Theory, 1993
- The linear programming bound for binary linear codesIEEE Transactions on Information Theory, 1993
- Nearly perfect binary codesDiscrete Mathematics, 1972
- A class of optimum nonlinear double-error-correcting codesInformation and Control, 1968
- A new upper bound for error-correcting codesIEEE Transactions on Information Theory, 1962
- On upper bounds for error detecting and error correcting codes of finite lengthIEEE Transactions on Information Theory, 1959