4-CYCLE FREE APM LDPC CODES WITH AN EXPLICIT CONSTRUCTION
From MaRDI portal
Publication:4956587
DOI10.22044/JAS.2020.9086.1441zbMath1468.11241OpenAlexW3154367058MaRDI QIDQ4956587
Mohammad Gholami, Zahra Gholami
Publication date: 2 September 2021
Full work available at URL: http://jas.shahroodut.ac.ir/article_1957_2e7bbb3d01640a654c06d6c41e61cedd.pdf
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Computer solution of Diophantine equations (11Y50)
Related Items (1)
Cites Work
- Unnamed Item
- Quasi-Cyclic LDPC Codes Based on Pre-Lifted Protographs
- Regular and irregular progressive edge-growth tanner graphs
- Good error-correcting codes based on very sparse matrices
- Searching for Voltage Graph-Based LDPC Tailbiting Codes With Large Girth
- On the Girth of Quasi-Cyclic Protograph LDPC Codes
This page was built for publication: 4-CYCLE FREE APM LDPC CODES WITH AN EXPLICIT CONSTRUCTION