Title of article
Uniqueness of certain completely regular Hadamard codes
Author/Authors
Gillespie، نويسنده , , Neil I. and Praeger، نويسنده , , Cheryl E.، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2013
Pages
7
From page
1394
To page
1400
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.
Keywords
Hadamard Codes , Completely transitive codes , Completely regular codes , Mathieu groups
Journal title
Journal of Combinatorial Theory Series A
Serial Year
2013
Journal title
Journal of Combinatorial Theory Series A
Record number
1531919
Link To Document