Low complexity construction for quasi-cyclic low-density parity-check codes by progressive-block growth

DOI10.1007/s11432-010-4152-0zbMath1241.94034OpenAlexW2000494984MaRDI QIDQ543230

PinYi Ren, Qiang Yuan, Rui Wang, Jun Cai

Publication date: 17 June 2011

Published in: Science China. Information Sciences (Search for Journal in Brave)

Full work available at URL: http://engine.scichina.com/doi/10.1007/s11432-010-4152-0

zbMATH Keywords

quasi-cyclic codesgirthLDPC codeslow-density parity-check codescirculant permutation matrix

Mathematics Subject Classification ID

Cyclic codes (94B15)

Related Items

Norm estimates of \(\omega\)-circulant operator matrices and isomorphic operators for \(\omega\)-circulant algebra ⋮ Norm equalities and inequalities for three circulant operator matrices

Uses Software

• LDPC

Cites Work

• Unnamed Item
• Expander codes
• Quasi-Cyclic Low-Density Parity-Check Codes From Circulant Permutation Matrices
• Regular and irregular progressive edge-growth tanner graphs
• Construction of Irregular LDPC Codes by Quasi-Cyclic Extension
• Quasi-Cyclic Low-Density Parity-Check Codes With Girth Larger Than $12$
• A recursive approach to low complexity codes
• The capacity of low-density parity-check codes under message-passing decoding
• Low-density parity-check codes based on finite geometries: a rediscovery and new results
• Good error-correcting codes based on very sparse matrices