Name
Abstract | ||
|---|---|---|
In this paper, we propose new constructions for regular girth-8 quasi-cyclic low-density parity-check (QC-LDPC) codes based on circulant permutation matrices (CPM). The constructions assume symmetries in the structure of the parity-check matrix and employ a greedy exhaustive search algorithm to find the permutation shifts of the CPMs. As a result of symmetries, the new codes have a more compact re... |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1109/TCOMM.2016.2617335 | IEEE Transactions on Communications |
Keywords | Field | DocType |
Parity check codes,Symmetric matrices,Linear matrix inequalities,Complexity theory,Additives,Simulation,Indexes | Hamming code,Discrete mathematics,Combinatorics,Low-density parity-check code,Block code,Turbo code,Expander code,Reed–Muller code,Linear code,Tornado code,Mathematics | Journal |
Volume | Issue | ISSN |
65 | 1 | 0090-6778 |
Citations | PageRank | References |
7 | 0.55 | 13 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Alireza Tasdighi | 1 | 24 | 2.36 |
| A. H. Banihashemi | 2 | 336 | 29.01 |
| Mohammad-Reza Sadeghi | 3 | 100 | 22.10 |