On the minimum distance graph of an extended Preparata code

Research output: Contribution to journalArticleResearchpeer-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 languageEnglish
Pages (from-to)161-168
JournalDesigns, Codes, and Cryptography
Volume57
DOIs
Publication statusPublished - 1 Nov 2010

Keywords

  • Extended Preparata code
  • Minimum distance graph
  • Preparata code

Fingerprint Dive into the research topics of 'On the minimum distance graph of an extended Preparata code'. Together they form a unique fingerprint.

Cite this