On the search of smallest QC-LDPC code with girth six and eight

DOI10.1007/s12095-019-00405-2zbMath1453.94038OpenAlexW2991418270WikidataQ126651992 ScholiaQ126651992MaRDI QIDQ2202911

Jasvinder Singh, Jaskarn Singh Bhullar, Manish K. Gupta

Publication date: 30 September 2020

Published in: Cryptography and Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12095-019-00405-2

zbMATH Keywords

girthcirculant permutation matrixexponent matrixquasi-cyclic low-density parity-check codes

Mathematics Subject Classification ID

Coding theorems (Shannon theory) (94A24)

Uses Software

• QC-LDPC
• LDPC

Cites Work

• Unnamed Item
• Constructions of QC LDPC codes based on integer sequences
• LDPC codes from triangle-free line sets
• Some low-density parity-check codes derived from finite geometries
• An explicit method to generate some QC LDPC codes with girth 8
• Codes with girth 8 Tanner graph representation
• Efficient Search of Girth-Optimal QC-LDPC Codes
• Quasi-Cyclic Low-Density Parity-Check Codes From Circulant Permutation Matrices
• Algebraic construction of sparse matrices with large girth
• A recursive approach to low complexity codes
• Searching for Voltage Graph-Based LDPC Tailbiting Codes With Large Girth
• Bounds on the Size of Parity-Check Matrices for Quasi-Cyclic Low-Density Parity-Check Codes
• On the Girth of Quasi-Cyclic Protograph LDPC Codes