Generalized low-density codes with BCH constituents for full-diversity near-outage performance Conference Paper uri icon


  • A new graph-based construction of generalized low density codes (GLD-Tanner) with binary BCH constituents is described. The proposed family of GLD codes is optimal on block erasure channels and quasi-optimal on block fading channels. Optimality is considered in the outage probability sense. A classical GLD code for ergodic channels (e.g., the AWGN channel, the i.i.d. Rayleigh fading channel, and the i.i.d. binary erasure channel) is built by connecting bitnodes and subcode nodes via a unique random edge permutation. In the proposed construction of full-diversity GLD codes (referred to as root GLD), bitnodes are divided into 4 classes, subcodes are divided into 2 classes, and finally both sides of the Tanner graph are linked via 4 random edge permutations. The study focuses on non-ergodic channels with two states and can be easily extended to channels with 3 states or more. 2008 IEEE.

name of conference

  • 2008 IEEE International Symposium on Information Theory - ISIT

published proceedings

  • 2008 IEEE International Symposium on Information Theory

author list (cited authors)

  • Boutros, J. J., Zemor, G., Guillen i Fabregas, A., & Biglieri, E.

citation count

  • 1

complete list of authors

  • Boutros, Joseph J||Zemor, Gilles||Guillen i Fabregas, Albert||Biglieri, Ezio

editor list (cited editors)

  • Kschischang, F. R., & Yang, E.

publication date

  • July 2008