DocumentCode
2768385
Title
From concatenated codes to graph codes
Author
Justesen, Jorn ; Hoholdt, Tom
Author_Institution
COM, Tech. Univ. Denmark, Lyngby, Denmark
fYear
2004
fDate
24-29 Oct. 2004
Firstpage
13
Lastpage
16
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;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory Workshop, 2004. IEEE
Print_ISBN
0-7803-8720-1
Type
conf
DOI
10.1109/ITW.2004.1405266
Filename
1405266
Link To Document