The Trapping Redundancy of Linear Block Codes

@article{Lndner2009TheTR,
  title={The Trapping Redundancy of Linear Block Codes},
  author={Stefan L{\"a}ndner and Thorsten Hehn and Olgica Milenkovic and Johannes B. Huber},
  journal={IEEE Transactions on Information Theory},
  year={2009},
  volume={55},
  pages={53-63}
}
We generalize the notion of the stopping redundancy in order to study the smallest size of a trapping set in Tanner graphs of linear block codes. In this context, we introduce the notion of the trapping redundancy of a code, which quantifies the relationship between the number of redundant rows in any parity-check matrix of a given code and the size of its smallest trapping set. Trapping sets with certain parameter sizes are known to cause error-floors in the performance curves of iterative… CONTINUE READING