Codes based on complete graphs

DOI10.1007/BF00130575zbMATH Open0943.94012MaRDI QIDQ677169FDOQ677169

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)

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 \geq 2\)
• Perfect codes in graphs

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)

Cites Work

• Graph theory with applications
• Title not available (Why is that?)
• Title not available (Why is that?)
• Graph theoretic error-correcting codes
• An application of difference sets to a problem concerning graphical codes
• An updated table of minimum-distance bounds for binary linear codes
• Title not available (Why is that?)
• Decoding of graph theoretic codes (Corresp.)

Cited In (10)

• Codes on graphs: Recent progress
• Title not available (Why is that?)
• 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)