On the girth of Tanner \((3,11)\) quasi-cyclic LDPC codes

DOI10.1016/j.ffa.2017.03.004zbMath1420.94107OpenAlexW2602611185MaRDI QIDQ2363320

Dan Feng, Baoming Bai, Cheng Sun, Hengzhou Xu

Publication date: 13 July 2017

Published in: Finite Fields and their Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ffa.2017.03.004

zbMATH Keywords

finite fieldgirthTanner graphquasi-cyclic (QC) LDPC codes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Other types of codes (94B60) Cyclic codes (94B15)

Related Items (1)

LDPC codes constructed from cubic symmetric graphs

Cites Work

• Unnamed Item
• Unnamed Item
• On quasi-cyclic codes as a generalization of cyclic codes
• On generator and parity-check polynomial matrices of generalized quasi-cyclic codes
• Quasi-Cyclic Low-Density Parity-Check Codes From Circulant Permutation Matrices
• On the girth of tanner (3, 5) quasi-cyclic LDPC codes
• Combinatorial Constructions of Low-Density Parity-Check Codes for Iterative Decoding
• A recursive approach to low complexity codes
• The capacity of low-density parity-check codes under message-passing decoding
• Good error-correcting codes based on very sparse matrices
• Channel Codes

This page was built for publication: On the girth of Tanner \((3,11)\) quasi-cyclic LDPC codes