Sciweavers

CORR
2008
Springer

Approaching Blokh-Zyablov Error Exponent with Linear-Time Encodable/Decodable Codes

13 years 11 months ago
Approaching Blokh-Zyablov Error Exponent with Linear-Time Encodable/Decodable Codes
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.
Zheng Wang, Jie Luo
Added 09 Dec 2010
Updated 09 Dec 2010
Type Journal
Year 2008
Where CORR
Authors Zheng Wang, Jie Luo
Comments (0)