Approaching Blokh-Zyablov error exponent with linear-time encodable/decodable codes

  • Authors:

  • Zheng Wang;Jie Luo

  • Affiliations:

  • Electrical and Computer Engineering Department, Colorado State University, Fort Collins, CO;Electrical and Computer Engineering Department, Colorado State University, Fort Collins, CO

  • Venue:
  • IEEE Communications Letters
  • Year:
  • 2009

  • Concatenated fountain codes

    ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4

Quantified Score

Hi-index 0.00

Visualization

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.