Name
Abstract | ||
|---|---|---|
In this letter, we obtain lower and upper bounds on the minimum distance dmin of low-density parity-check (LDPC) codes. The bounds are derived by categorizing the non-zero code words of an LDPC code into two categories of elementary and non-elementary. The first category contains code words whose induced subgraph has only degree-2 check nodes. We propose an efficient search algorithm that can find... |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1109/LCOMM.2017.2767028 | IEEE Communications Letters |
Keywords | Field | DocType |
Parity check codes,Upper bound,Search problems,Linear codes,NP-hard problem,Decoding | Discrete mathematics,Combinatorics,Search algorithm,Low-density parity-check code,Upper and lower bounds,Induced subgraph,Code word,Decoding methods,Mathematics | Journal |
Volume | Issue | ISSN |
22 | 1 | 1089-7798 |
Citations | PageRank | References |
0 | 0.34 | 10 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yoones Hashemi | 1 | 27 | 3.80 |
| Amir H. Banihashemi | 2 | 490 | 54.61 |