On the minimum distance graph of an extended Preparata code

Simple item page
dc.creatorFernández-Córdoba, C.
dc.creatorPhelps, K. T.
dc.date2009-02-09
dc.date.accessioned2026-07-07T12:39:24Z
dc.date.available2026-07-07T12:39:24Z
dc.descriptionThe 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.
dc.identifierhttps://arxiv.org/abs/0902.1351
dc.identifierhttp://arxiv.org/abs/0902.1351
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/219096
dc.subjectInformation Theory
dc.subjectDiscrete Mathematics
dc.titleOn the minimum distance graph of an extended Preparata code
dc.typetext

Files

Collections

arXiv