DocumentCode
2000782
Title
Graph-theoretic construction of low-density parity-check codes
Author
Djurdjevic, Ivana ; Lin, Shu ; Abdel-Ghaffar, Khaled
Author_Institution
Dept. of Electr. & Comput. Eng., California Univ., Davis, CA, USA
fYear
2003
fDate
29 June-4 July 2003
Firstpage
31
Abstract
This paper presents a novel graph-theoretic method for constructing low-density parity-check (LDPC) codes from connected graphs-without the requirement of large girth. The 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
graph theory; graphs; iterative decoding; parity check codes; trellis codes; LDPC code; connected graph; graph-theoretic code construction; iterative decoding; low-density parity-check code; trellis-based algorithm; Displays; Galois fields; Iterative algorithms; Iterative decoding; Joining processes; NASA; Null space; Parity check codes; Partitioning algorithms; Sparse matrices;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2003. Proceedings. IEEE International Symposium on
Print_ISBN
0-7803-7728-1
Type
conf
DOI
10.1109/ISIT.2003.1228045
Filename
1228045
Link To Document