Doped accumulate LT codes

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2007, Pages 2001-2005

  Yuan, Xiaojun ^a,b   Ping, Li ^a,b  

^a IEEE

^b CITY UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

INTERNATIONAL SYMPOSIUM; RAPTOR CODING;

COMPUTER NETWORKS; CYBERNETICS; DECODING; INFORMATION THEORY; PROGRAMMING THEORY; TECHNICAL PRESENTATIONS;

CODES (SYMBOLS);

EID: 51649085574     PISSN: 21578101     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2007.4557156     Document Type: Conference Paper

References (11)

1. M. Luby, "LT-codes," in Proc. 43rd Annu. IEEE Symp. Foundations of Computer Science (FOCS), Vancouver, BC, Canada, Nov. 2002, pp. 271-280.
2. A Shokrollahi, "Raptor codes", IEEE Trans. Inform. Theory, vol. 52, no. 6, June 2006.
3. A Shokrollahi, Raptor codes," in Proc. IEEE Int. Symp. Inform. Theory, Chicago, IL, USA, pp. 36, June/July 2004.
4. Li Ping and R. Sun, "Simple erasure correcting codes with capacity approaching performance," GLOBECOM '02, pp.1046-1050, 2002.
5. H. D. Pfster and I. Sason, "Accumulate-repeat-accumulate codes: systematic codes achieving the binary erasure channel capacity with bounded complexity," in Proc. 43rd Allerton Conf. Commun., Control and Computing, Monticello, IL, USA, Sep. 2005.
6. C. H. Hsu and A Anastasopoulos, "Capacity-achieving codes with bounded graphical complexity on noisy channels," in Proc. 43rd Allerton Conf. Communication, Control and Computing, Monticello, IL, USA, Sep. 2005.
7. H. Jin, A. Khandekar, and R. J. McEliece, "Irregular repeat-accumulate codes," in Proc. 2nd Int. Symp. Turbo codes & related topics, pp. 1-8, France, Sep. 2000.
8. T. Richaidson, A Shokrollahi and R. Urbanke, "Design of capacity-approaching irregular low-density parity-check codes," IEEE Trans. Inform. Theory, vol. 47, no. 2, pp. 619-637, Feb. 2001.
9. M. G. Luby, M. Mitzenmacher, A. Shokrollahi, and D. A. Spielman, "efficient erasure correcting codes," IEEE Trans. Inform. Theory, vol. 47, no. 2, pp. 569-584, Feb. 2001.
10. H. D. Pfister, I. Sason and R. Urbanke, "Capacity-achieving ensembles for the binary erasure channel with bounded complexity," IEEE Trans. Inform. Theory, vol. 51, no. 7, July 2005.
11. I. Sason and R. Urbanke, "Complexity versus performance of capacity-achieving irregular repeat-accumulate codes on the binary erasure channel," IEEE Trans. Inform. Theory, vol. 50, pp. 1247-1256, June 2004.