The linear programming bound 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), 677-680
- https://doi.org/10.1109/18.212302
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- A sharpening of the Johnson bound for binary linear codes and the nonexistence of linear codes with preparata parametersDesigns, Codes and Cryptography, 1993
- An updated table of minimum-distance bounds for binary linear codesIEEE Transactions on Information Theory, 1993
- New minimum distance bounds for certain binary linear codesIEEE Transactions on Information Theory, 1992
- The nonexistence of certain binary linear codesIEEE Transactions on Information Theory, 1990
- An updated table of minimum-distance bounds for binary linear codesIEEE Transactions on Information Theory, 1987
- On upper bounds for unrestricted binary-error-correcting codesIEEE Transactions on Information Theory, 1971
- Polynomial codesIEEE Transactions on Information Theory, 1968
- A characterization of flat spaces in a finite geometry and the uniqueness of the hamming and the MacDonald codesJournal of Combinatorial Theory, 1966
- A new upper bound for error-correcting codesIEEE Transactions on Information Theory, 1962