Title :
From concatenated codes to graph codes
Author :
Justesen, Jorn ; Hoholdt, Tom
Author_Institution :
COM, Tech. Univ. Denmark, Lyngby, Denmark
Abstract :
We consider codes based on simple bipartite expander graphs. These codes may be seen as the first step leading from product type concatenated codes to more complex graph codes. We emphasize constructions of specific codes of realistic lengths, and study the details of decoding by message passing in trees.
Keywords :
concatenated codes; decoding; graph theory; message passing; product codes; tree codes; bipartite expander graphs; decoding; graph codes; message passing; product type concatenated codes; trees; Bipartite graph; Concatenated codes; Decoding; Eigenvalues and eigenfunctions; Graph theory; Mathematics; Message passing; Parity check codes; Tin; Tree graphs;
Conference_Titel :
Information Theory Workshop, 2004. IEEE
Print_ISBN :
0-7803-8720-1
DOI :
10.1109/ITW.2004.1405266
