scientific article; zbMATH DE number 6874357

DOI10.11916/J.ISSN.1005-9113.16068MaRDI QIDQ4640468zbMATH OpenFDO

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

Publication date 25 May 2018

zbMATH Keywords

girthLDPC codesTanner graphquasi-cyclic

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Cyclic codes (94B15)

Recommendations

• On the girth of Tanner \((3, 7)\) quasi-cyclic LDPC codes
• On the girth of tanner (3, 5) quasi-cyclic LDPC codes
• On the girth of Tanner \((3,11)\) quasi-cyclic LDPC codes
• On the Girth of Quasi-Cyclic Protograph LDPC Codes
• On the Gröbner basis of a family of quasi-cyclic LDPC codes
• On the Encoding Complexity of Quasi-Cyclic LDPC Codes
• \((7,K)\) girth-8 QC-LDPC codes with an explicit construction
• Quasi-Cyclic LDPC Codes: Influence of Proto- and Tanner-Graph Structure on Minimum Hamming Distance Upper Bounds
• On quintic quasi-cyclic codes
• Construction of One-Coincidence Sequence Quasi-Cyclic LDPC Codes of Large Girth

Cited in

(4)

• On the girth of Tanner \((3, 7)\) quasi-cyclic LDPC codes
• On the girth of tanner (3, 5) quasi-cyclic LDPC codes
• Detecting cycles of length 8 in the Tanner graph of a QC-LDPC code based on protograph analysis
• On the girth of Tanner \((3,11)\) quasi-cyclic LDPC codes

This page was built for publication:

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