Rateless coding for arbitrary channel mixtures with decoder channel state information

IEEE Transactions on Information Theory

Volumn 55, Issue 9, 2009, Pages 4119-4133

  Draper, Stark C ^a   Kschischang, Frank R ^b   Frey, Brendan ^b  

^a University of Wisconsin Madison   (United States)

^b UNIVERSITY OF TORONTO   (Canada)

Author keywords

Arbitrarily varying channels; Channel coding; Erasure decoding; Error exponents; Individual sequence; Rateless codes; Variable length coding

Indexed keywords

ARBITRARILY VARYING CHANNELS; ERASURE DECODING; ERROR EXPONENTS; INDIVIDUAL SEQUENCE; RATELESS CODES; VARIABLE-LENGTH CODING;

BLOCK CODES; CHANNEL CODING; WIRELESS SENSOR NETWORKS; WIRELESS TELECOMMUNICATION SYSTEMS;

DECODING;

EID: 69449100068     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2009.2025577     Document Type: Article

References (30)

1. M. Luby, "LT codes," in Proc. 43rd Annu. IEEE Symp. Foundations of Computer Science, Vancouver, BC, Canada, Nov. 2002, pp. 271-282.
2. A. Shokrollahi, "Fountain codes," in Proc. 41st Allerton Conf. Communication, Control and Computing, Monticello, IL, Oct. 2003, pp. 1290-1297.
3. J. Byers, M. Luby,M. Mitzenmacher, and A. Rege, "A digital fountain approach to reliable distribution of bulk data," Proc. ACM SIGCOMM pp. 56-67, Oct. 1998.
4. O. Etesami, M. Molkaraie, and A. Shokrollahi, "Raptor codes on symmetric channels," in Proc. IEEE Int. Symp. Information Theory, Chicago, IL, Jun. 2004, p. 38.
5. R. Palanki and J. S. Yedidia, "Rateless codes on noisy channels," in Proc. IEEE Int. Symp. Information Theory, Chicago, IL, Jun. 2004, p. 37.
6. U. Erez, G. W.Wornell, and M. D. Trott, "Faster-than-Nyquist coding: The merits of a regime change," in Proc. 42nd Allerton Conf. Communication, Control and Computing, Monticello, IL, Sep. 2004, pp. 933-942.
7. N. Shulman, "Communication Over an Unknown Channel in Common Broadcasting," Ph.D. dissertation, Tel-Aviv Univ., Tel-Aviv, Israel, 2003.
8. S. C. Draper, B. J. Frey, and F. R. Kschischang, "Efficient variable length channel coding for unknown DMCS," in Proc. IEEE Int. Symp. Information Theory, Chicago, IL, Jun. 2004, p. 379.
9. A. Tchamkerten and E. Telatar, "Optimal feedback schemes over unknown channels," in Proc. IEEE Int. Symp. Information Theory, Chicago, IL, Jun. 2004, p. 378.
10. A. Tchamkerten and E. Telatar, "Variable length coding over an unknown channel," IEEE Trans. Inf. Theory, vol. 52, no. 5, pp. 2126-2145, May 2006.
11. S. C. Draper, "Universal incremental Slepian-Wolf coding," in Proc. 42nd Allerton Conf. Communication, Control and Computing, Monticello, IL, Oct. 2004, pp. 1332-1341.
12. S. Z. Stambler, "Shannon's theorems for a complete class of discrete channels whose state is known at the output," Probl. Pered. Inform. vol. 11, no. 4, pp. 3-12, 1975.
13. G. Caire and D. Tuninetti, "The throughput of hybrid-ARQ protocols for the Gaussian collision channel," IEEE Trans. Inf. Theory, vol. 47, no. 5, pp. 1971-1988, Jul. 2001.
14. R. Liu, P. Spasojeviać, and E. Soljanin, "Reliable channel regions for good binary codes transmitted over parallel channels," IEEE Trans. Inf. Theory, vol. 52, no. 4, pp. 1405-1424, Apr. 2006.
15. I. Sason and I. Goldenberg, "Coding for parallel channels: Gallager bounds and applications to turbo-like codes," IEEE Trans. Inf. Theory, vol. 53, no. 7, pp. 2394-2427, Jul. 2007.
16. R. Mantha and F. R. Kschischang, "A capacity-approaching hybrid ARQ scheme using turbo codes," in Proc. IEEE GLOBECOM, Rio de Janeiro, Brazil, 1999, pp. 2341-2345.
17. D. N. Rowitch and L. B. Milstein, "On the performance of hybrid FEC/ARQ systems using rate-compatible punctured turbo RCPT codes," IEEE Trans. Commun., vol. 48, no. 6, pp. 948-959, Jun. 2004.
18. S. Sesia, G. Caire, and G. Vivier, "Incremental redundancy hybrid ARQ schemes based on low-density parity-check codes," IEEE Trans. Commun., vol. 52, no. 8, pp. 1311-1321, Aug. 2004.
19. E. Soljanin, N. Varnica, and P. Whiting, "Incremental redundancy hybrid ARQ with LDPC and Raptor codes," IEEE Trans. Inform. Theory, submitted for publication.
20. G. D. Forney, "Exponential error bounds for erasure, list, and decision feedback schemes," IEEE Trans. Inf. Theory, vol. IT-14, no. 2, pp. 206-220, Mar. 1968.
21. A. Lapidoth and P. Narayan, "Reliable communication under channel uncertainty," IEEE Trans. Inf. Theory, vol. 44, no. 6, pp. 2148-2177, Oct. 1998.
22. I. Csiszar and J. Körner, Information Theory, Coding Theorems for Discrete Memoryless Systems. Budapest, Hungary: Akadémiai Kiadó, 1981.
23. A. Tchamkerten and E. Telatar, "A feedback strategy for binary symmetric channels," in Proc. IEEE Int. Symp. Information Theory, Lausanne, Switzerland, Jun. 2002, p. 362.
24. M. V. Burnashev, "Data transmission over a discrete channel with feedback. Random transmission time," Probl. Pered. Inform., vol. 12, no. 4, pp. 10-30, 1976.
25. O. Shayevitz and M. Feder, "Communicating using feedback over a binary channel with arbitrary noise sequence," in Proc. IEEE Int. Symp. Information Theory, Adelaide, Australia, Sep. 2005, pp. 1516-1520.
26. M. Horstein, "Sequential transmission using noiseless feedback," IEEE Trans. Inf. Theory, vol. IT-9, no. 4, pp. 136-143, Jul. 1963.
27. K. Eswaran, A. Sarwate, A. Sahai, and M. Gastpar, "Using zero-rate feedback on binary additive channels with individual noise sequences," in Proc. IEEE Int. Symp. Information Theory, Nice, France, Jun. 2007, pp. 1431-1435.
28. R. G. Gallager, Information Theory and Reliable Communication. New York: Wiley, 1968.
29. S. I. Gel'fand and M. S. Pinsker, "Coding for channels with random parameters," Probl. Contr. Inf. Theory, vol. 9, pp. 19-31, 1980.
30. R. Ahlswede, "Arbitrarily varying channels with states sequence known to the sender," IEEE Trans. Inf. Theory, vol. IT-32, no. 5, pp. 621-629, Sep. 1986.