Quasi-systematic doped LT codes

IEEE Journal on Selected Areas in Communications

Volumn 27, Issue 6, 2009, Pages 866-875

  Yuan, Xiaojun ^a   Ping, Li ^b  

^a University of Hawai i at Manoa   (United States)

^b CITY UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

LT codes; Quasi systematic doped Luby Transform (QS DLT) codes; Raptor codes

Indexed keywords

ENCODING AND DECODING; ERASURE CODES; LOW-COMPLEXITY; LT CODES; NUMERICAL RESULTS; PRIOR KNOWLEDGE; QUASI-SYSTEMATIC DOPED LUBY-TRANSFORM (QS-DLT) CODES; RAPTOR CODES;

COMMUNICATION;

CODES (SYMBOLS);

EID: 84055222316     PISSN: 07338716     EISSN: None     Source Type: Journal    
DOI: 10.1109/JSAC.2009.090805     Document Type: Article

References (20)

1. 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.
2. A. Shokrollahi, Capacity-Achieving Sequences. Minneapolis, MN: Inst. Mathematics and its Applications (IMA), 2000, vol. 123, IMA Volumes in Mathematics and its Applications, pp. 153-166.
3. P. Oswald and A. Shokrollahi, "Capacity-achieving sequences for the erasure channel, " IEEE Trans. Inform. Theory, vol. 48, no. 12, pp. 3017-3028, Dec. 2002.
4. H. D. Pfster and I. Sason, "Accumulate-repeat-accumulate codes: capacity-achieving ensembles of systematic codes for the erasure channel with bounded complexity, " IEEE Trans. Inform. Theory, vol. 53, no. 6, pp. 2088-2115, June 2007.
5. 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.
6. 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.
7. 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, pp. 2352-2379, July 2005.
8. I. Sason and R. Urbanke, "Complexity versus performance of capacityachieving irregular repeat-accumulate codes on the binary erasure channel, " IEEE Trans. Inform. Theory, vol. 50, pp. 1247-1256, June 2004.
9. T. Richardson, A. Shokrollahi and R. Urbanke, "Design of capacityapproaching irregular low-density parity-check codes, " IEEE Trans. Inform. Theory, vol. 47, no. 2, pp. 619-637, Feb. 2001.
10. J. Byers, M. Luby, M. Mitzenmacher, and A. Rege, "A digital fountain approach to reliable distribution of bulk data, " in Proc. ACMSIGCOMM' 98, Vancouver, BC, Canada, Jan. 1998, pp. 56-67.
11. M. Luby, "LT-codes, " in Proc. 43rd Annu. IEEE Symp. Foundations of Computer Science (FOCS), Vancouver, BC, Canada, Nov. 2002, pp. 271-280.
12. A. Shokrollahi, "Raptor codes", IEEE Trans. Inform. Theory, vol. 52, no. 6, pp. 2551-2567, June 2006.
13. X. Yuan and Li Ping, "Doped accumulate LT codes, " in Proc. IEEE Int. Symp. Inf. Theory (ISIT) 2007, Nice, France, June 2007, pp. 2001-2005.
14. O. Etesami and A. Shokrollahi, "Raptor codes on binary memoryless symmetric channels, " IEEE Trans. Inform. Theory, vol. 52, no. 5, pp. 2033-2051, May 2006.
15. D. Divsalar, H. Jin, and R. McEliece, "Coding theorems for 'turbolike' codes, " in Proc. 1998 Allerton Conf. Communication, Control and Computing, Monticello, IL, pp. 201-210, Oct. 1998.
16. Li Ping and R. Sun, "Simple erasure correcting codes with capacity approaching performance, " GLOBECOM '02, pp.1046-1050, 2002.
17. X. Yuan and Li Ping, "On systematic LT codes", IEEE Commun. Letters, vol. 12, no. 9, pp. 681-683, Sept. 2008.
18. C. Di, D. Proietti, BI. E. Telatar, T. Richardson, and R. Urbanke, "Finite length analysis of low-density parity-check codes on the binary erasure channel, " IEEE Trans. Inform. Theory, vol. 48, no. 6, pp. 1570-1579, Jun. 2002.
19. R. Karp, M. Luby, and A. Shokrollahi, "Finite length analysis of LT codes, " in Proc. IEEE Int. Symp. Inf. Theory, Chicago, IL, Jun./Jul. 2004, p. 39.
20. Li Ping, X. Huang and N. Phamdo, "Zigzag codes and concatenated zigzag codes, " IEEE Trans. Inform. Theory special issue on codes on graphs, vol., IT-47, no.2, pp., 800-807, Feb. 2001.