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

DOI10.1016/J.FFA.2017.03.004MaRDI QIDQ2363320zbMATH OpenOpenAlexFDO

Authors Hengzhou Xu, Baoming Bai, Dan Feng, Cheng Sun

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 fieldgirthquasi-cyclic (QC) LDPC codesTanner graph

Mathematics Subject Classification ID

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

Recommendations

• On the girth of tanner (3, 5) quasi-cyclic LDPC codes
• scientific article; zbMATH DE number 6874357
• On the girth of Tanner \((3, 7)\) quasi-cyclic LDPC codes
• Quasi-Cyclic Low-Density Parity-Check Codes From Circulant Permutation Matrices
• Codes with girth 8 Tanner graph representation

Cites work

• A recursive approach to low complexity codes
• Channel Codes
• Combinatorial Constructions of Low-Density Parity-Check Codes for Iterative Decoding
• Good error-correcting codes based on very sparse matrices
• scientific article; zbMATH DE number 3174791 (Why is no real title available?)
• On generator and parity-check polynomial matrices of generalized quasi-cyclic codes
• On quasi-cyclic codes as a generalization of cyclic codes
• On the girth of tanner (3, 5) quasi-cyclic LDPC codes
• On the girth of Tanner \((3, 7)\) quasi-cyclic LDPC codes
• Quasi-Cyclic Low-Density Parity-Check Codes From Circulant Permutation Matrices
• The capacity of low-density parity-check codes under message-passing decoding

Cited in

(8)

• LDPC codes constructed from cubic symmetric graphs
• Detecting cycles of length 10 in the Tanner graph of a QC-LDPC code based on protograph analysis
• On full-rank parity-check matrices of product codes
• On the girth of tanner (3, 5) quasi-cyclic LDPC codes
• scientific article; zbMATH DE number 6907319 (Why is no real title available?)
• scientific article; zbMATH DE number 6874357 (Why is no real title available?)
• On the girth of Tanner \((3, 7)\) quasi-cyclic LDPC codes
• Detecting cycles of length 8 in the Tanner graph of a QC-LDPC code based on protograph analysis

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

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