Uniqueness of certain completely regular Hadamard codes

@article{Gillespie2013UniquenessOC,
  title={Uniqueness of certain completely regular Hadamard codes},
  author={Neil I. Gillespie and C. Praeger},
  journal={J. Comb. Theory, Ser. A},
  year={2013},
  volume={120},
  pages={1394-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. 
On Completely Regular Codes
About non equivalent completely regular codes with identical intersection array
Completely regular codes with different parameters giving the same distance-regular coset graphs
Neighbour transitivity on codes in Hamming graphs
New characterisations of the Nordstrom-Robinson codes
Distance-regular graphs
2-Neighbour-Transitive Codes with Small Blocks of Imprimitivity
...
1
2
...

References

SHOWING 1-10 OF 45 REFERENCES
Completely regular codes
  • A. Neumaier
  • Computer Science, Mathematics
  • Discret. Math.
  • 1992
On complete regularity of extended codes
  • A. Brouwer
  • Computer Science, Mathematics
  • Discret. Math.
  • 1993
Completely regular codes and completely transitive codes
  • P. Solé
  • Computer Science, Mathematics
  • Discret. Math.
  • 1990
On a class of binary linear completely transitive codes with arbitrary covering radius
A note on completely regular codes
  • A. Brouwer
  • Computer Science, Mathematics
  • Discret. Math.
  • 1990
On q-ary linear completely regular codes with ρ=2 and antipodal dual
Recent Results on Perfect Codes and Related Topics
New Completely Regular $q$-ary Codes Based on Kronecker Products
On non-antipodal binary completely regular codes
A Note on a Result in the Theory of Code Construction
...
1
2
3
4
5
...