| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4655413 | Journal of Combinatorial Theory, Series A | 2013 | 7 Pages |
Abstract
We classify binary completely regular codes of length m with minimum distance δ for (m,δ)=(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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
