Codes based on complete graphs

DOI10.1007/BF00130575MaRDI QIDQ677169zbMATH OpenFDO

Authors Dieter Jungnickel, M. J. de Resmini, Scott A. Vanstone

Publication date 28 May 1997

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

zbMATH Keywords

embeddingcomplete graphHamming codeeven graphical code

Mathematics Subject Classification ID

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

Recommendations

• Graphical codes revisited
• Error correcting code generated by induced subgraphs \(K_{m-1}\) of complete graph \(K_m\)
• Codes from the incidence matrices and line graphs of Hamming graphs H^k(n,2) for k 2
• Perfect codes in graphs

Cites work

• scientific article; zbMATH DE number 3763833 (Why is no real title available?)
• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• scientific article; zbMATH DE number 951845 (Why is no real title available?)
• 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
• Graph theory with applications

Cited in

(10)

• Codes on graphs: Recent progress
• scientific article; zbMATH DE number 5300021 (Why is no real title available?)
• Structured Codes of Graphs
• Stopping sets of codes from complete graph
• Complete \(k\)-ary trees and Hamming graphs
• Error correcting code generated by induced subgraphs \(K_{m-1}\) of complete graph \(K_m\)
• Guest editorial: Special issue in honor of Scott A. Vanstone
• Sparse codes derived from graphs
• On graphs and codes preserved by edge local complementation
• Small weight bases for hamming codes

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q677169)