A Short Note on the Girth of Tanner (5,13)-Regular QC-LDPC Codes
- 1 November 2021
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 449-453
Abstract
This paper studies the girth of Tanner (5,13)-regular QC-LDPC codes. We present the conditions for the existence of cycles of lengths less than 12 in Tanner (5,13)-regular QC-LDPC codes of length ${13p}$ where ${p}$ is a prime of the form ${65i+1}$ , and transfer these conditions into the equations in a 65th root of unity of the prime field ${\mathbb{F}_p}$ . By checking the existence of solutions for these equations over ${\mathbb{F}_p}$ , we derive the girth distribution of Tanner (5,13)-regualr QC-LDPC codes.
Keywords
Funding Information
- NSFC (61801527,11971311,12026231,12026230)
- Natural Science Foundation of Henan (202300410523)
This publication has 9 references indexed in Scilit:
- On Finding Bipartite Graphs With a Small Number of Short Cycles and Large GirthIEEE Transactions on Information Theory, 2020
- Tanner $(J,L)$ Quasi-Cyclic LDPC Codes: Girth Analysis and Derived CodesIEEE Access, 2018
- Girth Analysis of Tanner (5,11) Quasi-Cyclic LDPC Codes2018
- Constructing Large Girth QC Protograph LDPC Codes Based on PSD-PEG AlgorithmIEEE Access, 2017
- Algebraic Quasi-Cyclic LDPC Codes: Construction, Low Error-Floor, Large Girth and a Reduced-Complexity Decoding SchemeIEEE Transactions on Communications, 2014
- Channel Codes2009
- On the girth of tanner (3, 5) quasi-cyclic LDPC codesIEEE Transactions on Information Theory, 2006
- Quasi-Cyclic Low-Density Parity-Check Codes From Circulant Permutation MatricesIEEE Transactions on Information Theory, 2004
- A recursive approach to low complexity codesIEEE Transactions on Information Theory, 1981