Name
Abstract | ||
|---|---|---|
Motivated by the works on the girth of Tanner (3,5), (3,7), (3,11), and (5,7) quasi-cyclic (QC) LDPC codes, we in this paper study the girth of Tanner (5,11) QC-LDPC codes. We first analyze the cycles of Tanner (5,11) QC-LDPC codes, and obtain the conditions for the existence of cycles of length less than 12 in Tanner (5,11) QC-LDPC codes of length 11p where p is a prime number and p =1 (mod 55). Notice that the condition is represented by the polynomial equations in a 55th root of unity of the prime field Fp. By checking the existence of solutions for these equations over Fp, the girths of Tanner (5,11) QC-LDPC codes are obtained. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1109/CIS2018.2018.00053 | 2018 14th International Conference on Computational Intelligence and Security (CIS) |
Keywords | Field | DocType |
LDPC code,quasi-cyclic,girth,prime field | Discrete mathematics,Mathematical optimization,Prime number,Prime field,Polynomial,Computer science,Low-density parity-check code,Root of unity | Conference |
ISBN | Citations | PageRank |
978-1-7281-0170-5 | 0 | 0.34 |
References | Authors | |
7 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hengzhou Xu | 1 | 12 | 12.24 |
| Hai Zhu | 2 | 87 | 22.69 |
| Mengmeng Xu | 3 | 0 | 2.37 |
| Bo Zhang | 4 | 95 | 47.19 |
| Sifeng Zhu | 5 | 2 | 1.75 |