On Raptor Codes

We introduce a construction of raptor codes to be used over symmetric channels. An important property of the proposed scheme is that unlike the previous construction of raptor codes, it allows to design codes that are approaching the capacity of the underlying channel in a rate-compatible way. We also show that for finite-length codes, the proposed construction outperforms the previous constructions of raptor codes.

[1]  Sae-Young Chung,et al.  On the construction of some capacity-approaching coding schemes , 2000 .

[2]  Joachim Hagenauer,et al.  Rate-compatible punctured convolutional codes (RCPC codes) and their applications , 1988, IEEE Trans. Commun..

[3]  Steve McLaughlin,et al.  Optimal puncturing distributions for rate-compatible low-density parity-check codes , 2003, IEEE International Symposium on Information Theory, 2003. Proceedings..

[4]  Rüdiger L. Urbanke,et al.  The capacity of low-density parity-check codes under message-passing decoding , 2001, IEEE Trans. Inf. Theory.

[5]  Faramarz Fekri,et al.  Results on punctured LDPC codes , 2004, Information Theory Workshop.

[6]  Michael Luby,et al.  LT codes , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[7]  Peter Jung,et al.  Performance of rate compatible punctured Turbo-codes for mobile radio applications , 1997 .

[8]  D. N. Rowitch Rate compatible punctured turbo (RCPT) codes in hybrid FEC/ARQ system , 1997 .

[9]  Jonathan S. Yedidia,et al.  Rateless codes on noisy channels , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

[10]  Omid Etesami,et al.  Raptor codes on symmetric channels , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

[11]  Rüdiger L. Urbanke,et al.  Design of capacity-approaching irregular low-density parity-check codes , 2001, IEEE Trans. Inf. Theory.