Name
Title | ||
|---|---|---|
Characterization of Elementary Trapping Sets in Irregular LDPC Codes and the Corresponding Efficient Exhaustive Search Algorithms. |
Abstract | ||
|---|---|---|
In this paper, we propose a characterization of elementary trapping sets (ETSs) for irregular low-density paritycheck (LDPC) codes. These sets are known to be the main culprits in the error floor region of such codes. The characterization of ETSs for irregular codes has been known to be a challenging problem due to the large variety of nonisomorphic ETS structures that can exist within the Tanner ... |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1109/TIT.2018.2799627 | IEEE Transactions on Information Theory |
Keywords | Field | DocType |
Parity check codes,Computational complexity,Terminology,Simulation,Decoding,Algorithm design and analysis | Discrete mathematics,Search algorithm,Algorithm design,Brute-force search,Low-density parity-check code,Computer science,Algorithm,Degree distribution,Tanner graph,Decoding methods,Computational complexity theory | Journal |
Volume | Issue | ISSN |
64 | 5 | 0018-9448 |
Citations | PageRank | References |
7 | 0.57 | 0 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yoones Hashemi | 1 | 27 | 3.80 |
| Amir H. Banihashemi | 2 | 490 | 54.61 |