Referenced Items are not available for this document.
The minimum distance graph of a code has the codewords as vertices and edges exactly when the Hamming distance between two codewords equals the minimum distance of the code. A constructive proof for reconstructibility of an extended perfect binary one-error-correcting code from its minimum distance graph is presented. Consequently, inequivalent such codes have nonisomorphic minimum distance graphs. Moreover, it is shown that the automorphism group of a minimum distance graph is isomorphic to that of the corresponding code.
Published in:
Information Theory, IEEE Transactions on
(Volume:55
,
Issue:
6
)
Date of Publication: June 2009
- Page(s):
- 2622 - 2625
- ISSN :
- 0018-9448
- INSPEC Accession Number:
- 10664375
- Digital Object Identifier :
- 10.1109/TIT.2009.2018338
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 19 May 2009
- Issue Date :
- June 2009
- Sponsored by :
- IEEE Information Theory Society
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
