On the minimum distance graph of an extended Preparata code

C. Fernández-Córdoba; K. T. Phelps

doi:10.1007/s10623-009-9358-z

On the minimum distance graph of an extended Preparata code

C. Fernández-Córdoba, K. T. Phelps

Departament d'Enginyeria de la Informació i de les Comunicacions

Producció científica: Contribució a revista › Article › Recerca › Avaluat per experts

2 Cites (Scopus)

Resum

The minimum distance graph of an extended Preparata code P(m) has vertices corresponding to codewords and edges corresponding to pairs of codewords that are distance 6 apart. The clique structure of this graph is investigated and it is established that the minimum distance graphs of two extended Preparata codes are isomorphic if and only if the codes are equivalent. © 2010 Springer Science+Business Media, LLC.

Idioma original	Anglès
Pàgines (de-a)	161-168
Revista	Designs, Codes, and Cryptography
Volum	57
Número	2
DOIs	https://doi.org/10.1007/s10623-009-9358-z
Estat de la publicació	Publicada - 1 de nov. 2010

Accés al document

10.1007/s10623-009-9358-z

Com citar-ho

@article{ffa80e68617147f7878e64a84ce6534f,

title = "On the minimum distance graph of an extended Preparata code",

abstract = "The minimum distance graph of an extended Preparata code P(m) has vertices corresponding to codewords and edges corresponding to pairs of codewords that are distance 6 apart. The clique structure of this graph is investigated and it is established that the minimum distance graphs of two extended Preparata codes are isomorphic if and only if the codes are equivalent. {\textcopyright} 2010 Springer Science+Business Media, LLC.",

keywords = "Extended Preparata code, Minimum distance graph, Preparata code",

author = "C. Fern{\'a}ndez-C{\'o}rdoba and Phelps, {K. T.}",

year = "2010",

month = nov,

day = "1",

doi = "10.1007/s10623-009-9358-z",

language = "English",

volume = "57",

pages = "161--168",

journal = "Designs, Codes, and Cryptography",

issn = "0925-1022",

publisher = "Springer Netherlands",

number = "2",

}

TY - JOUR

T1 - On the minimum distance graph of an extended Preparata code

AU - Fernández-Córdoba, C.

AU - Phelps, K. T.

PY - 2010/11/1

Y1 - 2010/11/1

N2 - The minimum distance graph of an extended Preparata code P(m) has vertices corresponding to codewords and edges corresponding to pairs of codewords that are distance 6 apart. The clique structure of this graph is investigated and it is established that the minimum distance graphs of two extended Preparata codes are isomorphic if and only if the codes are equivalent. © 2010 Springer Science+Business Media, LLC.

AB - The minimum distance graph of an extended Preparata code P(m) has vertices corresponding to codewords and edges corresponding to pairs of codewords that are distance 6 apart. The clique structure of this graph is investigated and it is established that the minimum distance graphs of two extended Preparata codes are isomorphic if and only if the codes are equivalent. © 2010 Springer Science+Business Media, LLC.

KW - Extended Preparata code

KW - Minimum distance graph

KW - Preparata code

U2 - 10.1007/s10623-009-9358-z

DO - 10.1007/s10623-009-9358-z

M3 - Article

SN - 0925-1022

VL - 57

SP - 161

EP - 168

JO - Designs, Codes, and Cryptography

JF - Designs, Codes, and Cryptography

IS - 2

ER -

On the minimum distance graph of an extended Preparata code

Resum

Accés al document

Fingerprint

Com citar-ho