LDPC codes from \(\mu\)-geodetic graphs obtained from block designs
From MaRDI portal
Publication:1741585
DOI10.1007/s00373-019-02007-4zbMath1408.94990OpenAlexW2913847105MaRDI QIDQ1741585
Dean Crnković, Sanja Rukavina, Marina Šimac
Publication date: 3 May 2019
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-019-02007-4
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the p-rank of the incidence matrix of a balanced or partially balanced incomplete block design and its applications to error correcting codes
- High-Rate Quantum Low-Density Parity-Check Codes Assisted by Reliable Qubits
- Construction of Low-Density Parity-Check Codes Based on Balanced Incomplete Block Designs
- Combinatorial Designs
- Low-density parity-check codes based on finite geometries: a rediscovery and new results
- Finite-length analysis of low-density parity-check codes on the binary erasure channel
- On the Dynamics of the Error Floor Behavior in (Regular) LDPC Codes