Abstract
We classify binary completely regular codes of length m with minimum distance delta for (m, delta) = (12,6) and (11,5). We prove that such codes are unique up to equivalence, and in particular, are equivalent to certain Hadamard codes. Moreover, we prove that these codes are completely transitive.
Original language | English |
---|---|
Pages (from-to) | 1394-1400 |
Number of pages | 7 |
Journal | Journal of Combinatorial Theory, Series A |
Volume | 120 |
Issue number | 7 |
Early online date | 22 Apr 2013 |
DOIs | |
Publication status | Published - Sept 2013 |
Keywords
- Completely regular codes
- Completely transitive codes
- Hadamard codes
- Mathieu groups
- transitive codes
- binary