Designs, Codes and Cryptography

, Volume 57, Issue 2, pp 161–168

On the minimum distance graph of an extended Preparata code


DOI: 10.1007/s10623-009-9358-z

Cite this article as:
Fernández-Córdoba, C. & Phelps, K.T. Des. Codes Cryptogr. (2010) 57: 161. doi:10.1007/s10623-009-9358-z


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.


Preparata code Extended Preparata code Minimum distance graph 

Mathematics Subject Classification (2000)

94B25 94C15 94C30 

Copyright information

© Springer Science+Business Media, LLC 2010

Authors and Affiliations

  1. 1.Department of Information and Communications EngineeringUniversitat Autònoma de BarcelonaBellaterraSpain
  2. 2.Department of Mathematics and StatisticsAuburn UniversityAuburnUSA