Computer Science – Information Theory
Scientific paper
2008-08-27
Computer Science
Information Theory
Submitted to IEEE Communications Letters
Scientific paper
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.
Luo Jie
Wang Zheng
No associations
LandOfFree
Approaching Blokh-Zyablov Error Exponent with Linear-Time Encodable/Decodable Codes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Approaching Blokh-Zyablov Error Exponent with Linear-Time Encodable/Decodable Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Approaching Blokh-Zyablov Error Exponent with Linear-Time Encodable/Decodable Codes will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-530009