Topics in multi-user information theory

Foundations and Trends in Communications and Information Theory

Volumn 4, Issue 4-5, 2007, Pages 265-444

  Kramer, Gerhard ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CYBERNETICS; IMAGE CODING; INFORMATION THEORY; SURVEYS;

(E ,2E) THEORY; BROADCAST CHANNEL (BC); CHANNEL MODELLING; FUNDAMENTAL CONCEPTS; GENERALIZED FEEDBACK; MULTI USERS; MULTI-ACCESS; MULTIPLE DESCRIPTION (MD); MULTIPLE RELAY CHANNELS; RANDOM CODING; RATE DISTORTION (R-D); RELAY CHANNELS; SLEPIAN WOLF; SOPHISTICATED TOOLS; SOURCE CODING; SUPERPOSITION CODING; WYNER-ZIV PROBLEM;

PROGRAMMING THEORY;

EID: 46849113249     PISSN: 15672190     EISSN: 15672328     Source Type: Journal    
DOI: 10.1561/0100000028     Document Type: Review

References (79)

1. R. Ahlswede, "Multi-way communication channels," in Proceedings of 2nd International Symposium Information Theory (1971), pp. 23-52, Tsahkadsor, Armenian S.S.R.: Publishing House of the Hungarian Academy of Sciences, 1973.
2. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, Network Flows: Theory, Algorithms, and Applications. Upper Saddle River, New Jersey: Prentice Hall, 1993.
3. N. Alon and J. H. Spencer, The Probabilistic Method. New York: Wiley, Second ed., 2000.
4. A. Amraoui, S. Dusad, and R. Urbanke, "Achieving general points in the 2-user Gaussian MAC without time-sharing or rate-splitting by means of iterative coding," in Proceedings of IEEE International Symposium on Information Theory, p. 334, Lausanne, Switzerland, June 30-July 5 2002.
5. M. R. Aref, Information Flow in Relay Networks. PhD thesis, Stanford, CA: Stanford University, October 1980.
6. T. Berger, "Multiterminal source coding," in The Information Theory Approach to Communications, (G. Longo, ed.), pp. 171-231, Berlin, Germany: Springer Verlag, 1978.
7. P. P. Bergmans, "Random coding theorem for broadcast channels with degraded components," IEEE Transactions on Information Theory, vol. 19, no. 2, pp. 197-207, March 1973.
8. P. P. Bergmans, "A simple converse for broadcast channels with additive white Gaussian noise," IEEE Transactions on Information Theory, vol. 20, no. 2, pp. 279-280, March 1974.
9. N. Blachman, "The convolution inequality for entropy powers," IEEE Transactions on Information Theory, vol. 11, no. 2, pp. 267-271, April 1965.
10. S. I. Bross, A. Lapidoth, and M. A. Wigger, "The Gaussian MAC with conferencing encoders," in Proceedings of IEEE International Symposium on Information Theory, Toronto, Canada, July 6-11 2008.
11. A. B. Carleial, "Multiple-access channels with different generalized feedback signals," IEEE Transactions on Information Theory, vol. 28, no. 6, pp. 841-850, November 1982.
12. A. S. Cohen and A. Lapidoth, "The Gaussian watermarking game," IEEE Transactions on Information Theory, vol. 48, no. 6, pp. 1639-1667, June 2002.
13. M. H. M. Costa, "Writing on dirty paper," IEEE Transactions on Information Theory, vol. 29, no. 3, pp. 439-441, May 1983.
14. T. Cover, "A proof of the data compression theorem of Slepian and Wolf for ergodic sources," IEEE Transactions on Information Theory, vol. 21, no. 2, pp. 226-228, March 1975.
15. T. M. Cover, "Broadcast channels," IEEE Transactions on Information Theory, vol. 18, no. 1, pp. 2-14, January 1972.
16. T. M. Cover and A. El Gamal, "Capacity theorems for the relay channel," IEEE Transactions on Information Theory, vol. 25, no. 5, pp. 572-584, September 1979.
17. T. M. Cover and C. Leung, "An achievable rate region for the multiple-access channel with feedback," IEEE Transactions on Information Theory, vol. 27, no. 3, pp. 292-298, May 1981.
18. T. M. Cover and J. A. Thomas, Elements of Information Theory. New York: John Wiley & Sons, 1991.
19. I. Csiszár and J. Körner, Information Theory: Coding Theorems for Discrete Memoryless Channels. Budapest: Akadémiai Kiadó, 1981.
20. R. L. Dobrushin, "Information transmission in a channel with feedback," Theory of Probabilistic Applications, vol. 34, pp. 367-383, December 1958.
21. A. El Gamal and M. Aref, "The capacity of the semideterministic relay channel," IEEE Transactions on Information Theory, vol. 28, no. 3, p. 536, May 1982.
22. A. El Gamal and T. M. Cover, "Achievable rates for multiple descriptions," IEEE Transactions on Information Theory, vol. 28, no. 6, pp. 851-857, November 1982.
23. A. El Gamal and E. C. van der Meulen, "A proof of Marton's coding theorem for the discrete memoryless broadcast channel," IEEE Transactions on Information Theory, vol. 27, no. 1, pp. 120-122, January 1981.
24. L. R. Ford and D. R. Fulkerson, "Maximal flow through a network," Canadian Journal of Mathematics, vol. 8, pp. 399-404, 1956.
25. N. Gaarder and J. Wolf, "The capacity region of a multiple-access discrete memoryless channel can increase with feedback," IEEE Transactions on Information Theory, vol. 21, no. 1, pp. 100-102, January 1975.
26. R. G. Gallager, Information Theory and Reliable Communication. New York: Wiley, 1968.
27. R. G. Gallager, "Capacity and coding for degraded broadcast channels," Problemy Peredachi Informatsii, vol. 10, no. 3, pp. 3-14, July-September 1974.
28. S. I. Gel'fand and M. S. Pinsker, "Coding for channels with random parameters," Problems of Control and Information Theory, vol. 9, no. 1, pp. 19-31, 1980.
29. A. J. Grant, B. Rimoldi, R. L. Urbanke, and P. A. Whiting, "Rate-splitting multiple-access for discrete memoryless channels," IEEE Transactions on Information Theory, vol. 47, no. 3, pp. 873-890, March 2001.
30. P. Gupta and P. R. Kumar, "Towards an information theory of large networks: An achievable rate region," IEEE Transactions on Information Theory, vol. 49, no. 8, pp. 1877-1894, August 2003.
31. R. A. Horn and C. R. Johnson, Matrix Analysis. Cambridge: Cambridge University Press, 1985.
32. O. Johnson, "A conditional entropy power inequality for dependent random variables," IEEE Transactions on Information Theory, vol. 50, no. 8, pp. 1581-1583, August 2004.
33. O. Johnson, Information Theory and the Central Limit Theorem. London, UK: Imperial College Press, 2004.
34. R. C. King, Multiple Access Channels with Generalized Feedback. PhD thesis, Stanford, CA: Stanford University, March 1978.
35. J. Körner and K. Marton, "General broadcast channels with degraded message sets," IEEE Transactions on Information Theory, vol. 23, no. 1, pp. 60-64, January 1977.
36. G. Kramer, Directed Information for Channels with Feedback, volume ETH Series in Information Processing. Vol. 11, Konstanz, Germany: Hartung-Gorre Verlag, 1998.
37. G. Kramer, "Capacity results for the discrete memoryless network," IEEE Transactions on Information Theory, vol. 49, no. 1, pp. 4-21, January 2003.
38. G. Kramer, M. Gastpar, and P. Gupta, "Cooperative strategies and capacity theorems for relay networks," IEEE Transactions on Information Theory, vol. 51, no. 9, pp. 3037-3063, September 2005.
39. G. Kramer, I. Marić, and R. D. Yates, "Cooperative communications," Foundations and Trends in Networking, vol. 1, no. 3-4, pp. 271-425, 2006.
40. G. Kramer and S. A. Savari, "Edge-cut bounds on network coding rates," Journal of Network and Systems Management, vol. 14, no. 1, pp. 49-67, March 2006.
41. Y. Liang and G. Kramer, "Rate regions for relay broadcast channels," IEEE Transactions on Information Theory, vol. 53, no. 10, pp. 3517-3535, October 2007.
42. H. Liao, "A coding theorem for multiple access communications," in Proceedings of IEEE International Symposium on Information Theory, Asilomar, CA, 1972.
43. K. Marton, "A coding theorem for the discrete memoryless broadcast channel," IEEE Transactions on Information Theory, vol. 25, no. 3, pp. 306-311, May 1979.
44. J. L. Massey, Applied Digital Information Theory. Zurich, Switerland: ETH Zurich, 1980-1998.
45. J. L. Massey, "Causality, feedback and directed information," in Proceedings of IEEE International Symposium on Information Theory Applications, pp. 27-30, Hawaii, USA, November 1990.
46. A. Orlitsky and J. R. Roche, "Coding for computing," IEEE Transactions on Information Theory, vol. 47, no. 3, pp. 903-917, March 2001.
47. L. Ozarow, "On a source-coding problem with two channels and three receivers," Bell System Technical Journal, vol. 59, no. 10, pp. 1909-1921, December 1980.
48. L. Ozarow, "The capacity of the white Gaussian multiple access channel with feedback," IEEE Transactions on Information Theory, vol. 30, no. 4, pp. 623-629, July 1984.
49. J. Pearl, Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. San Mateo, CA: Morgan Kaufmann, 1988.
50. S. S. Pradhan, R. Puri, and K. Ramchandran, "n-channel symmetric multiple-descriptions - Part I: (n,k) source-channel erasure codes," IEEE Transactions on Information Theory, vol. 50, no. 1, pp. 47-61, January 2004.
51. R. Puri, S. S. Pradhan, and K. Ramchandran, "n-channel symmetric multiple-descriptions - Part II: an achievable rate-distortion region," IEEE Transactions on Information Theory, vol. 51, no. 4, pp. 1377-1392, April 2005.
52. T. J. Richardson, A. Shokrollahi, and R. L. Urbanke, "Design of capacity-approaching low-density parity-check codes," IEEE Transactions on Information Theory, vol. 47, no. 2, pp. 619-637, February 2001.
53. B. Rimoldi and R. Urbanke, "A rate-splitting approach to the Gaussian multiple-access channel," IEEE Transactions on Information Theory, vol. 42, no. 2, pp. 364-375, March 1996.
54. H. Sato, "An outer bound to the capacity region of broadcast channels," IEEE Transactions on Information Theory, vol. 24, no. 3, pp. 374-377, May 1978.
55. C. E. Shannon, "A mathematical theory of communication," Bell System Technical Journal, vol. 27, pp. 379-423, 623-656, July and October 1948,
56. (Reprinted in Claude Elwood Shannon: Collected Papers, pp. 5-83, (N. J. A. Sloane and A. D. Wyner, eds.) Piscataway: IEEE Press, 1993).
57. C. E. Shannon, "The zero error capacity of a noisy channel," IRE Transaction Information Theory, vol. 2, pp. 221-238, September 1956,
58. (Reprinted in Claude Elwood Shannon: Collected Papers, (N. J. A. Sloane and A. D. Wyner, eds.) pp. 221-238, Piscataway: IEEE Press, 1993).
59. C. E. Shannon, "Coding theorems for a discrete source with a fidelity criterion," in IRE International Convention Record, pp. 142-163, March 1959.
60. (Reprinted in Claude Elwood Shannon: Collected Papers, (N. J. A. Sloane and A. D. Wyner, eds.) pp. 325-350, Piscataway: IEEE Press, 1993.
61. C. E. Shannon, "Two-way communication channels," in Proceedings of 4th Berkeley Symposium on Mathematical Statistics and Probability, (J. Neyman, ed.), pp. 611-644, Berkeley, CA: University California Press, 1961.
62. (Reprinted in Claude Elwood Shannon: Collected Papers, (N. J. A. Sloane and A. D. Wyner, eds.), pp. 351-384, Piscataway: IEEE Press, 1993).
63. D. Slepian and J. K. Wolf, "A coding theorem for multiple access channels with correlated sources," Bell System Technical Journal, vol. 52, pp. 1037-1076, September 1973.
64. D. Slepian and J. K. Wolf, "Noiseless coding of correlated information sources," IEEE Transactions on Information Theory, vol. 19, no. 9, pp. 471-480, July 1973.
65. A. Stam, "Some inequalities satisfied by the quantities of information of Fisher and Shannon," Information Control, vol. 2, pp. 101-112, July 1959.
66. E. Telatar, "Capacity of multi-antenna Gaussian channels," European Transactions on Telecommunication, vol. 10, no. 6, pp. 585-595, November-December 1999.
67. E. C. van der Meulen, Transmission of Information in a T-Terminal Discrete Memoryless Channel. PhD thesis, Berkeley, CA: University of California, January 1968.
68. R. Venkataramani, G.Kramer, and V. K. Goyal, "Multiple description coding with many channels," IEEE Transactions on Information Theory, vol. 49, no. 9, pp. 2106-2114, September 2003.
69. H. Wang and P. Viswanath, "Vector Gaussian multiple-description for individual and central receivers," IEEE Transactions on Information Theory, vol. 53, no. 6, pp. 2133-2153, June 2007.
70. H. Weingarten, Y. Steinberg, and S. Shamai (Shitz), "The capacity region of the Gaussian multiple-input multiple-output broadcast channel," IEEE Transactions on Information Theory, vol. 52, no. 9, pp. 3936-3964, September 2006.
71. F. M. J. Willems, Information Theoretical Results for the Discrete Memoryless Multiple Access Channel. PhD thesis, Leuven, Belgium: Katholieke Universiteit, October 1982.
72. F. M. J. Willems and E. C. van der Meulen, "The discrete memoryless multiple-access channel with cribbing encoders," IEEE Transactions on Information Theory, vol. 31, no. 3, pp. 313-327, May 1985.
73. A. D. Wyner, "A theorem on the entropy of certain binary sequences and applications: Part II," IEEE Transactions on Information Theory, vol. 19, no. 6, pp. 772-777, November 1973.
74. A. D. Wyner and J. Ziv, "A theorem on the entropy of certain binary sequences and applications: Part I," IEEE Transactions on Information Theory, vol. 19, no. 6, pp. 769-772, November 1973.
75. A. D. Wyner and J. Ziv, "The rate-distortion function for source coding with side information at the decoder," IEEE Transactions on Information Theory, vol. 22, no. 1, pp. 1-10, January 1976.
76. L.-L. Xie and P. R. Kumar, "A network information theory for wireless communication: scaling laws and optimal operation," IEEE Transactions on Information Theory, vol. 50, no. 5, pp. 748-767, May 2004.
77. L.-L. Xie and P. R. Kumar, "An achievable rate for the multiple-level relay channel," IEEE Transactions on Information Theory, vol. 51, no. 4, pp. 1348-1358, April 2005.
78. W. Yu, A. Sutivong, D. Julian, T. M. Cover, and M. Chiang, "Writing on colored paper," in Proceedings of 2001 IEEE International Symposium Information Theory, p. 302, Washington, DC, June 24-29 2001.
79. Z. Zhang and T. Berger, "New results in binary multiple descriptions," IEEE Transactions on Information Theory, vol. 33, no. 4, pp. 502-521, July 1987.