Rateless coding with partial CSI at the decoder

2007 IEEE Information Theory Workshop, ITW 2007, Proceedings

Volumn , Issue , 2007, Pages 378-383

  Sarwate, Anand D ^a   Gastpar, Michael ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CYBERNETICS; DECODING; INFORMATION THEORY;

(E ,2E) THEORY; CHANNEL MODELLING; CHANNEL QUALITIES; CODING SCHEMES; MULTICAST; PARTIAL CSI; STATE INFORMATION; STATE SEQUENCES; UNKNOWN STATES;

PROGRAMMING THEORY;

EID: 46749100230     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ITW.2007.4313104     Document Type: Conference Paper

References (23)

1. T. Cover, "Broadcast channels," IEEE Transactions on Information Theory, vol. 18, 1972.
2. J. Byers, M. Luby, and M. Mitzenmacher, "A digital fountain approach to asynchronous reliable multicast," IEEE Journal on Selected Areas in Communications, vol. 20, no. 8, pp. 1528-1540, 2002.
3. A. Shokrollahi, "Fountain codes," in Proceedings of the 41st Allerton Conference on Communication, Control, and Computing, October 2003, pp. 1290-1297.
4. E. Soljanin, "Hybrid ARQ in Wireless Networks," in DIMACS Workshop on Network Information Theory, March 2003.
5. R. Ahlswede and I. Csiszár, "Common Randomness in Information Theory and Cryptography - Part I: Secret Sharing," IEEE Transactions on Information Theory, vol. 39, no. 4, pp. 1121-1132, 1993.
6. N. Shulman, "Communication over an unknown channel via common broadcasting," Ph.D. dissertation, Tel Aviv University, 2003.
7. S. Draper, B. Frey, and F. Kschischang, "Efficient variable length channel coding for unknown dmcs," in Proceedings of the 2004 International Symposium on Information Theory, Chicago, USA, 2004.
8. A. Tchamkerten and I. E. Telatar, "Variable length coding over an unknown channel," IEEE Transactions on Information Theory, vol. 52, no. 5, pp. 2126-2145, May 2006.
9. S. Draper, B. Frey, and F. Kschischang, "Rateless coding for non-ergodic channels with decoder channel state information," submitted to IEEE Transactions of Information Theory.
10. O. Shayevitz and M. Feder, "Achieving the Empirical Capacity Using Feedback Part I: Memoryless Additive Models," submitted to IEEE Transactions on Information Theory.
11. S. Shamai (Shitz), E. Telatar, and S. Verdú, "Fountain capacity," in Proceedings of the 2006 International Symposium on Information Theory, Seattle, USA, 2006.
12. M. Langberg, "Private codes or Succinct random codes that are (almost) perfect," in Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2004), Rome, Italy, 2004.
13. A. Smith, "Scrambling Adversarial Errors Using Few Random Bits, Optimal Information Reconciliation, and Better Private Codes," in Proceedings of the 2007 ACM-SIAM Symposium on Discrete Algorithms (SODA 2007), 2007.
14. A. Sarwate and M. Gastpar, "Channels with nosy "noise", " in Proceedings of the 2007 IEEE International Symposium on Information Theory, Nice, France, 2007.
15. I. Csiszár and P. Narayan, "Arbitrarily Varying Channels with Constrained Inputs and States," IEEE Transactions on Information Theory, vol. 34, no. 1, pp. 27-34, 1988.
16. _, "The Capacity of the Arbitrarily Varying Channel Revisited :Positivity, Constraints," IEEE Transactions on Information Theory, vol. 34, no. 2, pp. 181-193, 1988.
17. R. Ahlswede, "Channel Capacities for List Codes," Journal of Applied Probability, vol. 10, no. 4, pp. 824-836, 1973.
18. _, "The Maximal Error Capacity of Arbitrarily Varying Channels for Constant List Sizes," IEEE Transactions on Information Theory, vol. 39, no. 4, pp. 1416-1417, 1993.
19. A. Sarwate and M. Gastpar, "Deterministic list codes for state-constrained arbitrarily varying channels," EECS Department, University of California, Berkeley, Tech. Rep. UCB/EECS-2007-5, January 8 2007. [Online]. Available: http://sipc.eecs.berkeley.edu/
20. R. Ahlswede, "Elimination of correlation in random codes for arbitrarily varying channels," Zeitschrift für Wahrscheinlichkeitstheorie und verwandte Gebiete, vol. 44, no. 2, pp. 159-175, 1978.
21. R. Ahlswede and G. Dueck, "Good codes can be produced by a few permutations," IEEE Transactions on Information Theory, vol. 28, no. 3, pp. 430-443, 1982.
22. K. Eswaran, A. Sarwate, A. Sahai, and M. Gastpar, "Binary additive channels with individual noise sequences and limited active feedback," in Proceedings of the 2007 IEEE International Symposium on Information Theory, Nice, France, 2007.
23. T. Cover and J. Thomas, Elements of Information Theory. New York: Wiley, 1991.