Uniqueness of certain completely regular Hadamard codes

Neil Gillespie; Cheryl Praeger

doi:10.1016/j.jcta.2013.04.006

Uniqueness of certain completely regular Hadamard codes

Neil Gillespie, Cheryl Praeger

Research output: Contribution to journal › Article › peer-review

7 Citations (Scopus)

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. © 2013 Elsevier Inc.

Original language	English
Pages (from-to)	1394-1400
Journal	Journal of Combinatorial Theory Series A
Volume	120
Issue number	7
DOIs	https://doi.org/10.1016/j.jcta.2013.04.006
Publication status	Published - 2013

Access to Document

10.1016/j.jcta.2013.04.006

Cite this

@article{0a52b96f7f7c4d07bb4ebc9f69b0bcc6,

title = "Uniqueness of certain completely regular Hadamard codes",

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. {\textcopyright} 2013 Elsevier Inc.",

author = "Neil Gillespie and Cheryl Praeger",

year = "2013",

doi = "10.1016/j.jcta.2013.04.006",

language = "English",

volume = "120",

pages = "1394--1400",

journal = "Journal of Combinatorial Theory Series A",

issn = "0097-3165",

publisher = "Academic Press",

number = "7",

}

TY - JOUR

T1 - Uniqueness of certain completely regular Hadamard codes

AU - Gillespie, Neil

AU - Praeger, Cheryl

PY - 2013

Y1 - 2013

N2 - 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. © 2013 Elsevier Inc.

AB - 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. © 2013 Elsevier Inc.

U2 - 10.1016/j.jcta.2013.04.006

DO - 10.1016/j.jcta.2013.04.006

M3 - Article

SN - 0097-3165

VL - 120

SP - 1394

EP - 1400

JO - Journal of Combinatorial Theory Series A

JF - Journal of Combinatorial Theory Series A

IS - 7

ER -

Uniqueness of certain completely regular Hadamard codes

Abstract

Access to Document

Fingerprint

Cite this