Rateless codes for AVC models

IEEE Transactions on Information Theory

Volumn 56, Issue 7, 2010, Pages 3105-3114

  Sarwate, Anand D ^a   Gastpar, Michael ^b,c  

^a University of California at San Diego   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c NONE   (Netherlands)

Author keywords

Adversarial models; Arbitrarily varying channels (AVCs); Randomization; Rateless coding

Indexed keywords

ACHIEVABLE RATE; ARBITRARILY VARYING CHANNELS (AVCS); CHANNEL INPUTS; CHANNEL MODEL; CHANNEL STATE; CODEWORD; COMMON RANDOMNESS; LIST DECODING; RANDOMIZED STRATEGY; RATELESS CODES; RATELESS CODING;

RANDOM PROCESSES;

INTERFERENCE SUPPRESSION;

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

References (35)

1. A. Sarwate and M. Gastpar, "Channels with nosy "noise", " in Proc. 2007 Int. Symp. Inf. Theory, Nice, France, 2007, submitted for publication.
2. A. Sarwate and M. Gastpar, "Rateless coding with partial CSI at the decoder," in Proc. 2007 Inf. Theory Workshop, Lake Tahoe, CA, Sep. 2007.
3. R. Ahlswede, "Channel capacities for list codes," J. Appl. Probabil., vol.10, no.4, pp. 824-836, 1973.
4. R. Ahlswede, "The maximal error capacity of arbitrarily varying channels for constant list sizes," IEEE Trans. Inf. Theory, vol.39, no.4, pp. 1416-1417, 1993.
5. A. Sarwate, "Robust and adaptive communication under uncertain interference," Ph.D. dissertation, Univ. Calif., Berkeley, Jul. 2008.
6. M. Langberg, "Private codes or succinct random codes that are (almost) perfect," in Proc. 45th Ann. IEEE Symp. Found. Comput. Sci. (FOCS 2004), Rome, Italy, 2004.
7. M. Luby, "LT codes," in Proc. 43rd Ann. IEEE Symp. Found. Comput. Sci., 2002.
8. A. Shokrollahi, "Fountain codes," in Proc. 41st Allerton Conf. Commun., Control, Comput., Oct. 2003, pp. 1290-1297.
9. N. Shulman, "Communication over an unknown channel via common broadcasting," Ph.D. dissertation, Tel Aviv Univ., Tel Aviv, Israel, 2003.
10. A. Tchamkerten and I. E. Telatar, "Variable length coding over an unknown channel," IEEE Trans. Inf. Theory, vol.52, no.5, pp. 2126-2145, May 2006.
11. S. S. (Shitz), I. E. Telatar, and S. Verdú, "Fountain capacity," IEEE Trans. Inf. Theory, vol.53, no.11, pp. 4372-4376, Nov. 2007.
12. K. Eswaran, A. Sarwate, A. Sahai, and M. Gastpar, "Zero-rate feedback can achieve the empirical capacity," IEEE Trans. Inf. Theory, vol.56, no.1, pp. 25-39, Jan. 2010.
13. D. Blackwell, L. Breiman, and A. Thomasian, "The capacities of certain channel classes under random coding," Ann. Math. Statist., vol.31, pp. 558-567, 1960.
14. J. Kiefer and J. Wolfowitz, "Channels with arbitrarily varying channel probability functions," Inf. Control, vol.5, no.1, pp. 44-54, 1962.
15. R. Ahlswede and J. Wolfowitz, "The capacity of a channel with arbitrarily varying channel probability functions and binary output alphabet," Zeitschrift fürWahrscheinlichkeit und verwandte Gebiete, vol.15, no.3, pp. 186-194, 1970.
16. R. Ahlswede, "A method of coding and an application to arbitrarily varying channels," J. Combinator., Inf. Syst. Sci., vol.5, pp. 10-35, 1980.
17. I. Csiszár and J. Körner, "On the capacity of the arbitrarily varying channel for maximum probability of error," Zeitschrift fürWahrscheinlichkeitstheorie und verwandte Gebiete, vol.57, pp. 87-101, 1981.
18. R. Ahlswede, "A note on the existence of the weak capacity for channels with arbitrarily varying channel probability functions and its relation to Shannon's zero-error capacity," Ann. Math. Statist., vol.41, pp. 1027-1033, 1970.
19. B. Hughes and P. Narayan, "Gaussian arbitrarily varying channels," IEEE Trans. Inf. Theory, vol.33, no.2, pp. 267-284, 1987.
20. I. Csiszár and P. Narayan, "Arbitrarily varying channels with constrained inputs and states," IEEE Trans. Inf. Theory, vol.34, no.1, pp. 27-34, 1988.
21. I. Csiszár and P. Narayan, "The capacity of the arbitrarily varying channel revisited: Positivity, constraints," IEEE Trans. Inf. Theory, vol.34, no.2, pp. 181-193, 1988.
22. I. Csiszár and P. Narayan, "Capacity of the Gaussian arbitrarily varying channel," IEEE Trans. Inf. Theory, vol.37, no.1, pp. 18-26, 1991.
23. T. Ericson, "Exponential error bounds for random codes on the arbitrarily varying channel," IEEE Trans. Inf. Theory, vol.IT-31, no.1, pp. 42-48, 1985.
24. B. Hughes and T. Thomas, "On error exponents for arbitrarily varying channels," IEEE Trans. Inf. Theory, vol.42, no.1, pp. 87-98, 1996.
25. T. Thomas and B. Hughes, "Exponential error bounds for random codes on Gaussian arbitrarily varying channels," IEEE Trans. Inf. Theory, vol.37, no.3, pp. 643-649, 1991.
26. 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.
27. R. Ahlswede, "Channels with arbitrarily varying channel probability functions in the presence of noiseless feedback," Zeitschrift für Wahrscheinlichkeit und verwandte Gebiete, vol.25, pp. 239-252, 1973.
28. I. Csiszár and J. Körner, Information Theory: Coding Theorems for Discrete Memoryless Systems.. Budapest, Hungary: Akadémi Kiadó, 1982.
29. A. Smith, "Scrambling adversarial errors using few random bits, optimal information reconciliation, and better private codes," in Proc. 2007 ACM-SIAM Symp. Discrete Algorithms (SODA 2007), 2007.
30. M. Agarwal, A. Sahai, and S. Mitter, "Coding into a source: A direct inverse rate-distortion theorem," in Proc. 45th Ann. Allerton Conf. Commun., Contr. Computat., 2006.
31. S. Draper, B. Frey, and F. Kschischang, "Rateless coding for non-ergodic channels with decoder channel state information," IEEE Trans. Inf. Theory, submitted for publication.
32. N. Shulman and M. Feder, "The uniform distribution as a uniform prior," IEEE Trans. Inf. Theory, vol.50, no.6, pp. 1356-1362, Jun. 2004.
33. N. Merhav and N. Feder, "Universal prediction," IEEE Trans. Inf. Theory, vol.44, no.6, pp. 2124-2147, Oct. 1998.
34. P. Erdös, P. Frankl, and Z. Füredi, "Families of finite sets in which no set is covered by the union of r others," Israel J. Math., vol.51, no.1-2, pp. 79-89, 1985.
35. T. Cover and J. Thomas, Elements of Information Theory. Hoboken, NJ: Wiley, 1991.