On the minimum distance graph of an extended Preparata code

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.

Keywords

Information Theory, Discrete Mathematics

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/219096

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/0902.1351
 http://arxiv.org/abs/0902.1351

Collections

arXiv