Uniqueness of certain completely regular Hadamard codes

@article{Gillespie2013UniquenessOC,
  title={Uniqueness of certain completely regular Hadamard codes},
  author={Neil I. Gillespie and Cheryl E. Praeger},
  journal={J. Comb. Theory, Ser. A},
  year={2013},
  volume={120},
  pages={1394-1400}
}
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. 

References

Publications referenced by this paper.
SHOWING 1-10 OF 22 REFERENCES

A remark on uniformly packed codes

  • L. A. Bassalygo, V. A. Zinov ′ ev
  • Problemy Peredači Informacii 13(3),
  • 1977
Highly Influential
7 Excerpts

Similar Papers

Loading similar papers…