Constructions of QC LDPC codes based on integer sequences

DOI10.1007/s11432-013-4971-xzbMath1357.94096OpenAlexW2104005865MaRDI QIDQ893757

N. E. Zubov

Publication date: 20 November 2015

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

Full work available at URL: http://engine.scichina.com/doi/10.1007/s11432-013-4971-x

zbMATH Keywords

integer sequenceslow-density parity-check codesdifference sequencesHoey sequencequasi cyclic codes

Mathematics Subject Classification ID

Cyclic codes (94B15)

Related Items (2)

On the search of smallest QC-LDPC code with girth six and eight ⋮ Construction of girth-8 \textit{(3,L)}-QC-LDPC codes of smallest CPM size using column multipliers

Cites Work

• Unnamed Item
• Unnamed Item
• Quasi-Cyclic Low-Density Parity-Check Codes From Circulant Permutation Matrices
• Explicit Construction of Families of LDPC Codes With No<tex>$4$</tex>-Cycles
• Quasi-Cyclic LDPC Codes for Fast Encoding
• LDPC Block and Convolutional Codes Based on Circulant Matrices
• Construction of Regular and Irregular LDPC Codes: Geometry Decomposition and Masking
• Construction of Quasi-Cyclic LDPC Codes for AWGN and Binary Erasure Channels: A Finite Field Approach
• A recursive approach to low complexity codes
• The capacity of low-density parity-check codes under message-passing decoding
• Design of capacity-approaching irregular low-density parity-check codes
• Good error-correcting codes based on very sparse matrices
• On the Construction of Structured LDPC Codes Free of Small Trapping Sets
• Construction of One-Coincidence Sequence Quasi-Cyclic LDPC Codes of Large Girth

This page was built for publication: Constructions of QC LDPC codes based on integer sequences