Optimal binary one-error-correcting codes of length 10 have 72 codewords
- 1 May 1999
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 45 (4) , 1229-1231
- https://doi.org/10.1109/18.761273
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- On the structure of optimal error-correcting codesDiscrete Mathematics, 1998
- Codes from Affine Permutation GroupsDesigns, Codes and Cryptography, 1998
- The uniqueness of the Best codeIEEE Transactions on Information Theory, 1994
- A new table of constant weight codesIEEE Transactions on Information Theory, 1990
- Binary codes with a minimum distance of four (Corresp.)IEEE Transactions on Information Theory, 1980
- Bounds for binary codes of length less than 25IEEE Transactions on Information Theory, 1978
- A conjecture on binary nongroup codes (Corresp.)IEEE Transactions on Information Theory, 1965
- Two improved block codes (Corresp.)IEEE Transactions on Information Theory, 1965
- On upper bounds for error detecting and error correcting codes of finite lengthIEEE Transactions on Information Theory, 1959
- Covering Problems Concerning Abelian GroupsJournal of the London Mathematical Society, 1952