Paper Info
Title
Concatenated codes: serial and parallel
Abstract
An analogy is examined between serially concatenated codes and parallel concatenations whose interleavers are described by bipartite graphs with good expanding properties. In particular, a modified expander code construction is shown to behave very much like Forney's classical concatenated codes, though with improved decoding complexity. It is proved that these new codes achieve the Zyablov bound δZ on the minimum distance. For these codes, a soft-decision, reliability-based, linear-time decoding algorithm is introduced, that corrects any fraction of errors up to almost δZ/2. For the binary-symmetric channel, this algorithm's error exponent attains the Forney bound previously known only for classical (serial) concatenations.
Year
DOI
Venue
2005
10.1109/TIT.2005.846392
IEEE Transactions on Information Theory
Keywords
DocType
Volume
minimum distance,new code,concatenated code,improved decoding complexity,bipartite graph,serially concatenated code,modified expander code construction,error exponent,classical concatenated code,binary-symmetric channel,linear-time decoding algorithm,channel coding,decoding,linear time,binary codes,binary symmetric channel,lower bound,channel capacity,sphere packing,concatenated codes
Journal
51
Issue
ISSN
ISBN
5
0018-9448
0-7803-7728-1
Citations 
PageRank 
References 
21
2.49
13
Authors
2
Name
Order
Citations
PageRank
Alexander Barg191085.90
G. Zemor223216.71