Graph-theoretic construction of low-density parity-check codes |
| |
| Authors: | Djurdjevic I Lin S Abdel-Ghaffar K |
| |
| Affiliation: | Dept. of Electr. & Comput. Eng., Univ. of California, Davis, CA, USA; |
| |
| 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. |
| |
| Keywords: | |
|
|
