Paper Info
Title
Approaching Blokh-Zyablov error exponent with linear-time encodable/decodable codes
Abstract
Guruswami and Indyk showed in [1] that Forney's error exponent can be achieved with linear coding complexity over binary symmetric channels. This paper extends this conclusion to general discrete-time memoryless channels and shows that Forney's and Blokh-Zyablov error exponents can be arbitrarily approached by one-level and multi-level concatenated codes with linear encoding/decoding complexity. The key result is a revision to Forney's general minimum distance decoding algorithm, which enables a low complexity integration of Guruswami-Indyk's outer codes into the concatenated coding schemes.
Year
DOI
Venue
2009
10.1109/LCOMM.2009.090047
Clinical Orthopaedics and Related Research
Keywords
DocType
Volume
decoding complexity,general discrete-time memoryless channel,linear coding complexity,approaching blokh-zyablov error exponent,blokh-zyablov error exponent,index terms— coding complexity,linear encoding,decodable code,error exponent,multi-level concatenated code,concatenated coding scheme,general minimum distance,low complexity integration,concatenated code,linear-time encodable,encoding,probability density function,linear time,error probability,discrete time,linear code,decoding,concatenated codes,binary symmetric channel,channel coding
Journal
13
Issue
ISSN
Citations 
6
1089-7798
2
PageRank 
References 
Authors
0.42
6
2
Name
Order
Citations
PageRank
Zheng Wang140.85
Jie Luo270673.44