Graph theoretic error-correcting codes
From MaRDI portal
Publication:5546456
DOI10.1109/TIT.1968.1054190zbMath0162.51204MaRDI QIDQ5546456
S. Louis Hakimi, Jon G. Bredeson
Publication date: 1968
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Related Items (12)
An application of difference sets to a problem concerning graphical codes ⋮ An application of coding theory to a problem in graphical enumeration ⋮ Algebraic theory of block codes detecting independent errors ⋮ A characterization of graphs by codes from their incidence matrices ⋮ Cobiased graphs: single-element extensions and elementary quotients of graphic matroids ⋮ Codes from incidence matrices of graphs ⋮ Hulls of codes from incidence matrices of connected regular graphs ⋮ Codes based on complete graphs ⋮ The covering radius of the cycle code of a graph ⋮ Secret sharing schemes based on graphical codes ⋮ Incomplete block design codes for ultra high speed computer applications ⋮ Maximality of the cycle code of a graph
This page was built for publication: Graph theoretic error-correcting codes
