Quasi-cyclic LDPC codes of column-weight two using a search algorithm
From MaRDI portal
Publication:836560
DOI10.1155/2007/45768zbMath1168.94518DBLPjournals/ejasp/MalemaL07OpenAlexW1994369721WikidataQ58735177 ScholiaQ58735177MaRDI QIDQ836560
Gabofetswe Malema, Michael Liebelt
Publication date: 1 September 2009
Published in: EURASIP Journal on Advances in Signal Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2007/45768
Related Items (1)
Cites Work
- Quasi-Cyclic Low-Density Parity-Check Codes From Circulant Permutation Matrices
- Fast generation of regular graphs and construction of cages
- Low-density parity-check codes based on finite geometries: a rediscovery and new results
- Overlapped Message Passing for Quasi-Cyclic Low-Density Parity Check Codes
This page was built for publication: Quasi-cyclic LDPC codes of column-weight two using a search algorithm