Channels with nosy noise

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2007, Pages 996-1000

  Sarwate, Anand D ^a   Gastpar, Michael ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

INTERNATIONAL SYMPOSIUM; STATE CONSTRAINTS;

INFORMATION THEORY; TECHNICAL PRESENTATIONS;

PROGRAMMING THEORY;

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

References (19)

1. D. Blackwell, L. Breiman, and A. Thomasian, "The capacities of certain channel classes under random coding," Annals of Mathematical Statistics, vol. 31, pp. 558-567, 1960.
2. I. Csiszár and J. Körner, Information Theory: Coding Theorems for Discrete Memoryless Systems. Budapest: Akadémi Kiadó, 1982.
3. R. Ahlswede and J. Wolfowitz, "Correlated Decoding for Channels with Arbitrarily Varying Channel Probability Functions," Information and Control, vol. 14, pp. 457-473, 1969.
4. 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.
5. 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.
6. M. Agarwal, A. Sahai, and S. Mitter, "Coding into a source: a direct inverse rate-distortion theorem," in 45th Annual Allerton Conference on Communication, Control and Computation, 2006.
7. 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.
8. _, "The Capacity of the Arbitrarily Varying Channel Revisited : Positivity, Constraints," IEEE Transactions on Information Theory, vol. 34, no. 2, pp. 181-193, 1988.
9. 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.
10. A. Sarwate and M. Gastpar, "Randomization Bounds on Gaussian arbitrarily varying channels," in Proceedings of the 2006 International Symposium on Information Theory, Seattle, WA, 2006.
11. 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.
12. _, "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.
13. B. Hughes and T. Thomas, "On Error Exponents for Arbitrarily Varying Channels," IEEE Transactions on Information Theory, vol. 42, no. 1, pp. 87-98, 1996.
14. 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/
15. T. Cover and J. Thomas, Elements of Information Theory. New York: Wiley, 1991.
16. P. Elias, "List decoding for noisy channels," in Wescon Convention Record, Part 2. Institute of Radio Engineers (now IEEE), 1957, pp. 94-104.
17. V. Guruswami, J. Høastad, M. Sudan, and D. Zuckerman, "Combinatorial Bounds for List Decoding," IEEE Transactions on Information Theory, vol. 48, no. 5, pp. 1021-1034, 2002.
18. V. Guruswami, "List Decoding From Erasures: Bounds and Code Constructions," IEEE Transactions on Information Theory, vol. 49, no. 11, pp. 2826-2833, 2003.
19. S. S. (Shitz) and S. Verdú, "Worst-Case Power-Constrained Noise Binary-Input Channels," IEEE Transactions on Information Theory, vol. 38, no. 5, pp. 1494-1511, 1992.