Trapping sets of fountain codes

Authors:
Vivian Lucia Orozco;Shahram Yousefi
Affiliations:
Signal Design and Analysis Laboratory, Department of Electrical and Computer Engineering, Queen's University, Kingston, ON;Signal Design and Analysis Laboratory, Department of Electrical and Computer Engineering, Queen's University, Kingston, ON
Venue:
IEEE Communications Letters
Year:
2010

Citing 3
Cited 0

LT Codes

FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Raptor codes

IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Raptor codes on binary memoryless symmetric channels

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

The remarkable results of Fountain codes over the binary erasure channel (BEC) have motivated research on their practical implementation over noisy channels. Trapping sets are a phenomenon of great practical importance for certain graph codes on noisy channels. Although trapping sets have been extensively studied for low-density parity-check (LDPC) codes, to the best of our knowledge they have never been fully explored for Fountain codes. In this letter, we demonstrate that trapping sets are damaging to the realized rate and decoding cost of Fountain codes. Furthermore, we show that through trapping set detection we may combat these negative effects.