Performance bounds for erasure, list and feedback schemes with linear block codes
Eran Hof, Igal Sason, Shlomo Shitz Shamai · 2009
A message independence property and some new performance upper bounds are reported for erasure, list and decision-feedback schemes with linear block codes transmitted over memoryless symmetric channels. Similarly to the classical work of Forney, this work is focused on the derivation of some Gallager-type bounds on the achievable tradeoffs for these coding schemes, where the main novelty is the suitability of the bounds for both random and structured linear block codes (or code ensembles). The bounds are applicable to finite-length codes and to the asymptotic case of infinite block length, and they are applied to low-density parity-check (LDPC) code ensembles.