LDPC codes based on algebraic graphs
From MaRDI portal
Recommendations
Cites work
- A characterization of the components of the graphs \(D(k,q)\)
- A Mathematical Theory of Communication
- Error-correcting codes from graphs
- Expander codes
- Explicit construction of graphs with an arbitrary large girth and of large size
- Good codes based on very sparse matrices
- scientific article; zbMATH DE number 3174791 (Why is no real title available?)
- scientific article; zbMATH DE number 3652373 (Why is no real title available?)
- scientific article; zbMATH DE number 43547 (Why is no real title available?)
- Improved low-density parity-check codes using irregular graphs
- New examples of graphs without small cycles and of large size
- On extremal graph theory, explicit algebraic constructions of extremal graphs and corresponding Turing encryption machines
Cited in
(6)
This page was built for publication: LDPC codes based on algebraic graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5406683)