Quasi-cyclic LDPC codes of column-weight two using a search algorithm

DOI10.1155/2007/45768MaRDI QIDQ836560zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Gabofetswe Malema, Michael Liebelt

Publication date 1 September 2009

Published in EURASIP Journal on Advances in Signal Processing (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1155/2007/45768

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Recommendations

• Low complexity construction for quasi-cyclic low-density parity-check codes by progressive-block growth
• A class of quasi-cyclic LDPC codes from \(B_2\pmod m\) sequences
• On the search of smallest QC-LDPC code with girth six and eight
• Quasi-Cyclic LDPC Codes for Fast Encoding
• Quasi-Cyclic Low-Density Parity-Check Codes From Circulant Permutation Matrices

Cites work

• 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
• Quasi-Cyclic Low-Density Parity-Check Codes From Circulant Permutation Matrices

Cited in

(2)

• A class of quasi-cyclic LDPC codes from \(B_2\pmod m\) sequences
• Graph-based convolutional and block LDPC codes

This page was built for publication: Quasi-cyclic LDPC codes of column-weight two using a search algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q836560)