On the minimum distance graph of an extended Preparata code

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

doi:https://doi.org/10.1007/s10623-009-9358-z

On the minimum distance graph of an extended Preparata code

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

Department of Information and Communications Engineering

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

2 Citations (Scopus)

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. © 2010 Springer Science+Business Media, LLC.

Original language	English
Pages (from-to)	161-168
Journal	Designs, Codes, and Cryptography
Volume	57
Issue number	2
DOIs	https://doi.org/10.1007/s10623-009-9358-z
Publication status	Published - 1 Nov 2010

Keywords

Extended Preparata code
Minimum distance graph
Preparata code

Access to Document

https://doi.org/10.1007/s10623-009-9358-z

Cite this

@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 = "https://doi.org/10.1007/s10623-009-9358-z",

language = "English",

volume = "57",

pages = "161--168",

journal = "Designs, Codes, and Cryptography",

issn = "0925-1022",

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 - https://doi.org/10.1007/s10623-009-9358-z

DO - https://doi.org/10.1007/s10623-009-9358-z

M3 - Article

VL - 57

SP - 161

EP - 168

JO - Designs, Codes, and Cryptography

JF - Designs, Codes, and Cryptography

SN - 0925-1022

IS - 2

ER -

On the minimum distance graph of an extended Preparata code

Abstract

Keywords

Access to Document

Fingerprint

Cite this