LDPC Codes Based on Algebraic Graphs
From MaRDI portal
Publication:5406683
DOI10.2478/v10065-012-0034-yzbMath1284.94154MaRDI QIDQ5406683
Monika Polak, Vasiliy A. Ustimenko
Publication date: 2 April 2014
Published in: Annales UMCS, Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2478/v10065-012-0034-y
05C90: Applications of graph theory
94B05: Linear codes (general theory)
05C25: Graphs and abstract algebra (groups, rings, fields, etc.)
05C75: Structural characterization of families of graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Mathematical Theory of Communication
- New examples of graphs without small cycles and of large size
- Error-correcting codes from graphs
- Explicit construction of graphs with an arbitrary large girth and of large size
- A characterization of the components of the graphs \(D(k,q)\)
- On Extremal Graph Theory, Explicit Algebraic Constructions of Extremal Graphs and Corresponding Turing Encryption Machines
- Expander codes
- Improved low-density parity-check codes using irregular graphs
- Good codes based on very sparse matrices