Name
Abstract | ||
|---|---|---|
In this paper, we study the cycle structure of quasi-cyclic (QC) low-density parity-check (LDPC) codes with the goal of obtaining the shortest code with a given degree distribution and girth. We focus on QC-LDPC codes, whose Tanner graphs are cyclic liftings of fully connected base graphs of size 3 × n, n ≥ 4, and obtain minimal lifting degrees that result in girths 6 and 8. This is performed thro... |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1109/TIT.2016.2523979 | IEEE Transactions on Information Theory |
Keywords | Field | DocType |
Parity check codes,Bipartite graph,Indexes,Computer science,Computers,Manganese | Hamming code,Discrete mathematics,Concatenated error correction code,Combinatorics,Group code,Block code,Turbo code,Expander code,Linear code,Reed–Muller code,Mathematics | Journal |
Volume | Issue | ISSN |
62 | 4 | 0018-9448 |
Citations | PageRank | References |
11 | 0.66 | 8 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Alireza Tasdighi | 1 | 24 | 2.36 |
| Amir H. Banihashemi | 2 | 490 | 54.61 |
| Mohammad-Reza Sadeghi | 3 | 100 | 22.10 |