LDPC codes from cubic semisymmetric graphs
From MaRDI portal
Recommendations
Cites work
- A census of semisymmetric cubic graphs on up to 768 vertices
- A recursive approach to low complexity codes
- A refined classification of symmetric cubic graphs
- Channel Codes
- Cubic edge-transitive graphs of order 2\(p^{3}\)
- Cubic semisymmetric graphs of order \(6p^{3}\)
- Explicit Construction of Families of LDPC Codes With No<tex>$4$</tex>-Cycles
- Fundamentals of Error-Correcting Codes
- G-graphs: An efficient tool for constructing symmetric and semisymmetric graphs
- Galois geometries and low-density parity-check codes
- Good error-correcting codes based on very sparse matrices
- Graph theory
- scientific article; zbMATH DE number 3290993 (Why is no real title available?)
- LDPC codes constructed from cubic symmetric graphs
- LDPC codes from \(\mu\)-geodetic graphs obtained from block designs
- On the Dynamics of the Error Floor Behavior in (Regular) LDPC Codes
- Quantum Error Correction and Orthogonal Geometry
- Regular line-symmetric graphs
Cited in
(6)
This page was built for publication: LDPC codes from cubic semisymmetric graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5074502)
