Paper Info
Title
From Concatenated Codes To Graph Codes
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.
Year
DOI
Venue
2004
10.1109/ITW.2004.1405266
2004 IEEE INFORMATION THEORY WORKSHOP, PROCEEDINGS
Keywords
DocType
Citations 
decoding,expander graph,graph theory,message passing,concatenated codes
Conference
0
PageRank 
References 
Authors
0.34
5
2
Name
Order
Citations
PageRank
jorn justesen1183.14
Tom Høholdt218628.53