The extended Nadler code is unique (Corresp.)
- 1 January 1977
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 23 (1) , 132-135
- https://doi.org/10.1109/tit.1977.1055665
Abstract
Constructions for a 32-word binary code of length 12 and minimum distance 5 were given by Nadler in 1962 and van Lint in 1972. These codes are not equivalent as their distance distributions are not the same. That their extended codes of length 13 are equivalent is proved. It is shown that up to a permutation of the coordinates, there is an essentially unique way to construct the extended code. This unique extended code contains only two inequivalent punctured codes of length 12.Keywords
This publication has 6 references indexed in Scilit:
- Four fundamental parameters of a code and their combinatorial significanceInformation and Control, 1973
- A new description of the Nadler code (Corresp.)IEEE Transactions on Information Theory, 1972
- On the Golay perfect binary codeJournal of Combinatorial Theory, Series A, 1971
- Coding theory and the Mathieu groupsInformation and Control, 1971
- An optimum nonlinear codeInformation and Control, 1967
- A 32-point n=12, d=5 code (Corresp.)IRE Transactions on Information Theory, 1962