Graph theoretic error-correcting codes
From MaRDI portal
Recommendations
Cited in
(20)- Algebraic theory of block codes detecting independent errors
- Maximality of the cycle code of a graph
- An application of difference sets to a problem concerning graphical codes
- Error-correcting codes from graphs
- An application of coding theory to a problem in graphical enumeration
- Codes from incidence matrices of graphs
- Secret sharing schemes based on graphical codes
- Hulls of codes from incidence matrices of connected regular graphs
- Incomplete block design codes for ultra high speed computer applications
- Decay of Correlations for Sparse Graph Error Correcting Codes
- scientific article; zbMATH DE number 5953464 (Why is no real title available?)
- A characterization of graphs by codes from their incidence matrices
- Fault-tolerant cube graphs and coding theory
- scientific article; zbMATH DE number 1424165 (Why is no real title available?)
- Double and Triple Node-Erasure-Correcting Codes Over Complete Graphs
- Graph-Theoretical Constructions for Graph Entropy and Network Coding Based Communications
- Graph-Based Decoding in the Presence of ISI
- Cobiased graphs: single-element extensions and elementary quotients of graphic matroids
- Codes based on complete graphs
- The covering radius of the cycle code of a graph
This page was built for publication: Graph theoretic error-correcting codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5546456)
