Name
Abstract | ||
|---|---|---|
This article presents a graph-theoretic method for constructing low-density parity-check (LDPC) codes from connected graphs without the requirement of large girth. This method is based on finding a set of paths in a connected graph, which satisfies the constraint that any two paths in the set are either disjoint or cross each other at one and only one vertex. Two trellis-based algorithms for finding these paths are devised. Good LDPC codes of practical lengths are constructed and they perform well with iterative decoding. |
Year | DOI | Venue |
|---|---|---|
2003 | 10.1109/LCOMM.2003.809990 | IEEE Communications Letters |
Keywords | Field | DocType |
Parity check codes,Iterative algorithms,Iterative decoding,Sparse matrices,Null space | Factor graph,Discrete mathematics,Combinatorics,Concatenated error correction code,Low-density parity-check code,Computer science,Block code,Turbo code,Serial concatenated convolutional codes,Raptor code,Linear code | Journal |
Volume | Issue | ISSN |
7 | 4 | 1089-7798 |
Citations | PageRank | References |
3 | 0.56 | 4 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| ivana djurdjevic | 1 | 63 | 3.16 |
| Shu Lin | 2 | 575 | 133.22 |
| K. Abdel-Ghaffar | 3 | 238 | 13.36 |