Codes based on complete graphs

DOI10.1007/BF00130575zbMath0943.94012MaRDI QIDQ677169

Scott A. Vanstone, Marialuisa J. De Resmini, Dieter Jungnickel

Publication date: 28 May 1997

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

zbMATH Keywords

embeddingHamming codecomplete grapheven graphical code

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (1)

Guest editorial: Special issue in honor of Scott A. Vanstone

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An application of difference sets to a problem concerning graphical codes
• An updated table of minimum-distance bounds for binary linear codes
• Decoding of graph theoretic codes (Corresp.)
• Graph theoretic error-correcting codes

This page was built for publication: Codes based on complete graphs