UCSD ECE 287A
Network Information Theory
Winter 2008
References
This list of references will be constantly updated and expanded as the course progresses. We won't attempt to give a complete coverage of the literature, but will sample a few key papers and review articles.
Basic Information Theory:
  • A. D. Wyner, ``The capacity of the band-limited Gaussian channel,'' Bell Syst. Tech. J., vol. 45, pp. 359-395, March 1966. (pdf)
  • D. Slepian, ``On bandwidth,'' Proc. IEEE, vol. 64, no. 3, pp. 292-300, March 1976. (pdf)
  • S. Verdu, ``On channel capacity per unit cost,'' IEEE Trans. Inf. Theory, vol. IT-36, pp. 1019-1030, September 1990. (pdf)
Entropy Power Inequality:
  • C. E. Shannon, ``A mathematical theory of communication,'' Bell Syst. Tech. J., vol. 27, pp. 623-656, Oct. 1948. (pdf)
  • A. J. Stam, ``Some inequalities satisfied by the quantities of information of Fisher and Shannon,'' Information and Control, vol. 2, pp. 101-112, 1959. (pdf)
  • N. M. Blachman, ``The convolution inequality for entropy powers,'' IEEE Trans. Inf. Theory, vol. IT-11, pp. 267-271, April 1965. (pdf)
  • M. H. M. Costa and T. M. Cover, ``On the similarity of the entropy power inequality and the Brunn-Minkowski inequality,'' IEEE Trans. Inf. Theory, vol. IT-30, pp. 837-839, November 1984. (pdf)
  • M. H. M. Costa, ``A new entropy power inequality,'' IEEE Trans. Inf. Theory, vol. IT-31, pp. 751-760, Nov. 1985. (pdf)
  • S. Shamai and A. D. Wyner, ``A binary analog to the entropy-power inequality,'' IEEE Trans. Inf. Theory, vol. IT-36, pp. 1428-1430, November 1990. (pdf)
  • A. Dembo, T. M. Cover, and J. A. Thomas, ``Information theoretic inequalities,'' IEEE Trans. Inf. Theory, vol. IT-37, pp. 1501-1518, November 1991. (pdf)
  • R. Zamir and M. Feder, ``A generalization of the entropy power inequality with applications,'' IEEE Trans. Inf. Theory, vol. IT-39, pp. 1723-1728, Sep. 1993. (pdf)
  • R. J. Gardner, ``The Brunn-Minkowski inequality,'' Bull. Amer. Math. Soc., vol. 39, pp. 355-405, 2002. (pdf)
  • S. Verdu and D. Guo, ``A simple proof of the entropy-power inequality,'' IEEE Trans. Inf. Theory, vol. IT-52, pp. 2165-2166, May 2006. (pdf)
  • T. Liu and P. Viswanath, ``An extremal inequality motivated by multiterminal information theoretic problems,'' to appear in IEEE Trans. Inf. Theory. (arXiv:cs/0604025)
Correlated Sources:
  • D. Slepian and J. K. Wolf, ``Noiseless coding of correlated information sources,'' IEEE Trans. Inf. Theory, vol. IT-19, pp. 471-480, July 1973. (pdf)
  • T. M. Cover, ``A proof of the data compression theorem of Slepian and Wolf for ergodic sources,'' IEEE Trans. Inf. Theory, vol. IT-21, pp. 226-228, March 1975. (pdf)
  • T. M. Cover, A. El Gamal and M. Salehi ``Multiple access channels with arbitrarily correlated sources,'' IEEE Trans. Inf. Theory, vol. IT-26, pp. 648 - 657, November 1980. (pdf)
  • G. Dueck, ``A note on the multiple access channel with correlated sources,'' IEEE Trans. Inf. Theory, vol. IT-27, pp. 232-235, March 1981. (pdf)
  • R. Ahlswede and T. S. Han, ``On source coding with side information via a multiple-access channel and related problems in multi-user information theory,'' IEEE Trans. Inf. Theory, vol. IT-29, pp. 396-412, May 1983. (pdf)
  • F. M. J. Willems, ``Totally asynchronous Slepian-Wolf data compression,'' IEEE Trans. Inf. Theory, vol. IT-34, pp. 35-44, January 1988. (pdf)
Multiple Access Channel:
  • C. E. Shannon, ``Two-way communication channels,'' in Proc. 4th Berkeley Symp. Probab. Statistics, vol. I, pp. 611-644, 1961.
  • R. Ahlswede, ``Multiway communication channels,'' in Proceedings of 2nd International Symposium on Information Theory, Thakadsor, Armenian SSR, Sept. 1971, Akademiai Kiado, Budapest, pp. 23-52. (pdf)
  • H. H. J. Liao ``Multiple access channels (Ph.D. Thesis abstract),'' IEEE Trans. Inf. Theory, vol. IT-19, p. 253, March 1973.
  • D. Slepian and J. K. Wolf, ``A coding theorem for multiple access channels with correlated sources,'' Bell Syst. Tech. J., vol. 52, pp. 1037-1076, September 1973.
  • A. D. Wyner, ``Recent results in the Shannon theory,'' IEEE Trans. Inf. Theory, vol. IT-20, pp. 2-10, January 1974. (pdf)
  • T. M. Cover, ``Some advances in broadcast channels,'' in Advances in Communication Systems, edited by A. J. Viterbi, Academic Press, San Francisco, 1975, vol. 4, pp. 229-260. (pdf)
  • E. C. van der Meulen, ``A survey of multi-way channels in information theory: 1961-1976,'' IEEE Trans. Inf. Theory, vol. IT-23, pp. 1-37, January 1977. (pdf)
  • T. M. Cover, R. J. McEliece, and E. C. Posner, ``Asynchronous multiple-access channel capacity,'' IEEE Trans. Inf. Theory, vol. IT-27, pp. 409-413, July 1981. (pdf)
  • R. G. Gallager, ``A perspective on multiaccess channels,'' IEEE Trans. Inf. Theory, vol. IT-31, pp. 124 - 142, March 1985. (pdf)
  • E. C. van der Meulen, ``Recent coding theorems and converses for multi-way channels--II: The multiple access channel (1976-1985),'' Department Wiskunde, Katholieke Universiteit Leuven, Leuven, Belgium, 1985. (pdf)
  • J. Y. N. Hui and P. A. Humblet, ``The capacity region of the totally asynchronous multiple-access channel,'' IEEE Trans. Inf. Theory, vol. IT-31, pp. 207-216, March 1985. (pdf)
  • R. S. Cheng and S. Verdu, ``Gaussian multiaccess channels with ISI: Capacity region and multiuser water-filling,'' IEEE Trans. Inf. Theory, vol. IT-39, pp. 773 - 785, May 1993. (pdf)
  • D. N. C. Tse and S. V. Hanly, ``Multiaccess fading channels--I: Polymatroid structure, optimal resource allocation and throughput capacities,'' IEEE Trans. Inf. Theory, vol. IT-44, pp. 2796-2815, November 1998. (pdf)
  • S. V. Hanly and D. N. C. Tse, ``Multiaccess fading channels--II: Delay-limited capacities,'' IEEE Trans. Inf. Theory, vol. IT-44, pp. 2816--2831, November 1998. (pdf)
  • A. J. Grant, B. Rimoldi, R. L. Urbanke, and P. A. Whiting, ``Rate-splitting multiple access for discrete memoryless channels,'' IEEE Trans. Inf. Theory, vol. IT-47, pp. 873 - 890, March 2001. (pdf)
  • H. G. Eggleston, ``Proof of Caratheordory's theorem,'' in Convexity, Cambridge University Press, Cambridge, 1969. (pdf)
Broadcast Channel:
  • T. M. Cover, ``Broadcast channels,'' IEEE Trans. Inf. Theory, vol. IT-18, pp. 2-14, January 1972. (pdf)
  • P. P. Bergmans, ``Random coding theorem for broadcast channels with degraded components,'' IEEE Trans. Inf. Theory, vol. IT-19, pp. 197-207, March 1973. (pdf)
  • P. P. Bergmans, ``A simple converse for broadcast channels with additive white Gaussian noise,'' IEEE Trans. Inf. Theory, vol. IT-20, pp. 279-280, March 1974. (pdf)
  • P. P. Bergmans and T. M. Cover, ``Cooperative broadcasting,'' IEEE Trans. Inf. Theory, vol. IT-20, pp. 317-324, May 1974. (pdf)
  • R. G. Gallager, ``Capacity and coding for degraded broadcast channels,'' Probl. Pered. Inform., vol. 10, no. 3, pp. 3-14, July-Sept. 1974. (pdf)
  • E. C. van der Meulen, ``Random coding theorems for the general discrete memoryless broadcast channel,'' IEEE Trans. Inf. Theory, vol. IT-21, pp. 180-190, March 1975. (pdf)
  • R. Ahlswede and J. Korner, ``Source coding with side information and a converse for degraded broadcast channels,'' IEEE Trans. Inf. Theory, vol. IT-21, pp. 629-637, November 1975. (pdf)
  • T. M. Cover, ``An achievable rate region for the broadcast channel,'' IEEE Trans. Inf. Theory, vol. IT-21, pp. 399-404, July 1975. (pdf)
  • T. M. Cover, ``Some advances in broadcast channels,'' in Advances in Communication Systems, edited by A. J. Viterbi, Academic Press, San Francisco, 1975, vol. 4, pp. 229-260. (pdf)
  • J. Korner and K. Marton, ``General broadcast channels with degraded message sets,'' IEEE Trans. Inf. Theory, vol. IT-23, pp. 60-64, January 1977. (pdf)
  • H. Sato, ``An outer bound to the capacity region of broadcast channels,'' IEEE Trans. Inf. Theory, vol.IT-24, pp.374-377, May 1978. (pdf)
  • M. Salehi, "Cardinality bounds on auxilliary random variables in multiple-user theory via the method of Ahlswede and Korner,'' Technical Report No. 33, Dept. of Statistics, Stanford University, August 1978. (pdf)
  • A. El Gamal, ``The capacity of a class of broadcast channels,'' IEEE Trans. Inf. Theory, vol. IT-25, pp. 166-169, March 1979. (pdf)
  • K. Marton, ``A coding theorem for the discrete memoryless broadcast channel,'' IEEE Trans. Inf. Theory, vol. IT-25, pp. 306-311, May 1979. (pdf)
  • A. El Gamal and E. C. van der Meulen, ``A proof of Marton's coding theorem for the discrete memoryless broadcast channel, IEEE Trans. Inf. Theory, vol. IT-27, pp. 120-122, January 1981. (pdf)
  • E. C. van der Meulen, ``Recent coding theorems and converses for multi-way channels--I: The broadcast channel (1976-1980),'' in New Concepts in Multi-user Communication (NATO Advanced Study Insititute Series), edited by J. K. Skwyrzinsky, pp. 15-51, Sijthoff & Noordhoff International, 1981. (pdf)
  • T. S. Han and M. H. M. Costa, ``Broadcast channels with arbitrarily correlated sources,'' IEEE Trans. Inf. Theory, vol. IT-33, pp. 641-650, September 1987. (pdf)
  • T. M. Cover, ``Comments on broadcast channels,'' IEEE Trans. Inf. Theory, vol. IT-44, pp. 2524-2530, October 1998. (pdf)
  • A. J. Goldsmith and M. Effros, ``The capacity region of broadcast channels with intersymbol interference and colored Gaussian noise,'' IEEE Trans. Inf. Theory, vol. IT-47, pp. 219-240, January 2001. (pdf)
  • L. Lifang and A. J. Goldsmith, `` Capacity and optimal resource allocation for fading broadcast channels--I. Ergodic capacity,'' IEEE Trans. Inf. Theory, vol. IT-47, pp. 1083-1102, March 2001. (pdf)
  • S. Vishwanath, N. Jindal, and A. J. Goldsmith, ``Duality, achievable rates, and sum-rate capacity of Gaussian MIMO broadcast channels,'' IEEE Trans. Inf. Theory, vol. IT-49, pp. 2658-2668, October 2003. (pdf)
  • H. Weingarten, Y. Steinberg, and S. Shamai (Shitz), ``The capacity region of the Gaussian multiple-input multiple-output broadcast channel,'' IEEE Trans. Inf. Theory, vol. IT-52, pp. 3936-3964, September 2006. (pdf)
  • C. Nair and A. El Gamal, ``An outer bound to the capacity region of the broadcast channel,'' IEEE Trans. Inf. Theory, vol. IT-53, pp. 350-355, January 2007. (pdf)
  • M. Mohseni and J. M. Cioffi, ``A proof of the converse for the capacity of Gaussian MIMO broadcast channels,'' submitted to IEEE Trans. Inf. Theory, 2006. (pdf)
Interference Channel:
  • A. B. Carleial, A case where interference does not reduce capacity, IEEE Trans. Inf. Theory, vol. IT-21, pp. 569-570, September 1975. (pdf)
  • A. B. Carleial, ``Interference channels,'' IEEE Trans. Inf. Theory, vol. IT-24, pp. 60-70, January 1978. (pdf)
  • H. Sato, ``On the capacity region of a discrete two-user channel for strong interference,'' IEEE Trans. Inf. Theory, vol. IT-24, pp. 377-379, May 1978. (pdf)
  • T. S. Han and K. Kobayashi, ``A new achievable rate region for the interference channel,'' IEEE Trans. Inf. Theory, vol. IT-27, pp. 49-60, January 1981. (pdf)
  • H. Sato, ``The capacity of the Gaussian interference channel under strong interference,'' IEEE Trans. Inf. Theory, vol. IT-27, pp. 786-788, November 1981. (pdf)
  • A. El Gamal and M. H. M. Costa, ``The capacity region of a class of deterministic interference channels,'' IEEE Trans. Inf. Theory, vol. IT-28, pp. 343-346, March 1982. (pdf)
  • A. B. Carleial, ``Outer bounds on the capacity of interference channels,'' IEEE Trans. Inf. Theory, vol. IT-29, pp. 602-606, July 1983. (pdf)
  • M. H. M. Costa, ``On the Gaussian interference channel,'' IEEE Trans. Inf. Theory, vol. IT-31, pp. 607-615, September 1985. (pdf)
  • M. H. M. Costa and A. El Gamal, ``The capacity region of the discrete memoryless interference channel with strong interference,'' IEEE Trans. Inf. Theory, vol. IT-33, pp. 710-711, September 1987. (pdf)
  • R. S. Cheng and S. Verdu, ``On limiting characterizations of memoryless multiuser capacity regions,'' IEEE Trans. Inf. Theory, vol. IT-39, pp. 609-612, March 1993. (pdf)
  • E. C. van der Meulen, ``Some reflections on the interference channel,'' in Communications and Cryptography: Two Sides of One Tapestry, edited by R. E. Blahut, D. J. Costello, U. Maurer, and T. Mittelholzer, Kluwer, Boston, pp. 409-421, 1994.
  • G. Kramer, ``Outer bounds on the capacity of Gaussian interference channels,'' IEEE Trans. Inf. Theory, vol. IT-50, pp. 581-586, March 2004. (pdf)
  • I. Sason, ``On achievable rate regions for the Gaussian interference channel,'' IEEE Trans. Inf. Theory, vol. IT-50, pp. 1345-1356, June 2004. (pdf)
  • H. Chong, M. Motani, H. Garg, and H. El Gamal, ``On the Han-Kobayashi Region for the Interference Channel,'' submitted to IEEE Trans. Inf. Theory. (pdf)
  • R. Etkin, D. Tse, and H. Wang, ``Gaussian interference channel capacity to within one bit,'' submitted to IEEE Trans. Inf. Theory. (arXiv:cs/0702045)
Source Coding with Side Information:
  • A. D. Wyner, ``On source coding with side information at the decoder,'' IEEE Trans. Inf. Theory, vol. IT-21, pp. 294-300, May 1975.
  • R. F. Ahlswede and J. Korner, ``Source coding with side information and a converse for degraded broadcast channels,'' IEEE Trans. Inf. Theory, vol. IT-21, pp. 629-637, November 1975.
  • J. Korner and K. Marton, `` How to encode the modulo-two sum of binary sources,'' IEEE Trans. Inf. Theory, vol. IT-25, pp. 219-221, March 1979. (pdf)
Relay Channel:
  • E. C. van der Meulen ``Three-terminal communication channels,'' Adv. Appl. Prob., vol. 3, pp. 120-154, 1971. (JSTOR)
  • T. M. Cover and A. El Gamal, ``Capacity theorems for the relay channel,'' IEEE Trans. Inf. Theory, vol. IT-25, pp. 572-584, September 1979. (pdf)
  • A. El Gamal and M. Aref, ``The capacity of the semideterministic relay channel,'' IEEE Trans. Inf. Theory, vol. IT-28, p. 536, May 1982. (pdf)
  • T. M. Cover, ``The capacity of the relay channel,'' in Open Problems in Communication and Computation, edited by T. M. Cover and B. Gopinath, Springer-Verlag, 1987, pp. 72-73. (pdf)
  • Z. Zhang, ``Partial converse for a relay channel,'' IEEE Trans. Inf. Theory, vol. IT-34, pp. 1106-1110, September 1988. (pdf)
  • C. M. Zeng , F. Kuhlmann, and A. Buzo, ``Achievability proof of some multiuser channel coding theorems using backward decoding,'' IEEE Trans. Inf. Theory, vol. IT-35, pp. 1160-1165, Nov. 1989. (pdf)
  • A. El Gamal and S. Zahedi, `` Capacity of a class of relay channels with orthogonal components,'' IEEE Trans. Inf. Theory, vol. IT-51, pp. 1815-1817, May 2005. (pdf)
  • G. Kramer, M. Gastpar, and P. Gupta, ``Cooperative strategies and capacity theorems for relay networks,'' IEEE Trans. Inf. Theory, vol. IT-51, no. 9, pp. 3037-3063, Sep. 2005. (pdf)
  • A. El Gamal, M. Mohseni, and S. Zahedi, ``Bounds on capacity and minimum energy-per-bit for AWGN relay channels,'' IEEE Trans. Inf. Theory, vol. IT-52, pp. 1545-1561, Apr. 2006. (pdf)
  • A. El Gamal, N. Hassanpour, and J. Mammen, ``Relay networks with delay,'' submitted to IEEE Trans. Inf. Theory, 2006. (pdf)
  • T. M. Cover and Y.-H. Kim, ``Capacity of a class of deterministic relay channels,'' submitted to IEEE Trans. Inf. Theory, 2006. (arXiv:cs.IT/0611053)
  • H.-F. Chong, M. Motani, and H. K. Garg, ``Generalized backward decoding strategies for the relay channel,'' IEEE Trans. Inf. Theory, vol. IT-53, pp. 394-401, Jan. 2007. (pdf)
  • M. Aleksic, P. Razaghi, and W. Yu, ``Capacity of a class of modulo-sum relay channels,'' to be presented at IEEE Int. Symp. Inf. Theory, Nice, France, 2007. (arXiv:0704.3591)
Feedback:
  • C. E. Shannon, ``The zero error capacity of a noisy channel,'' IRE Trans. Inf. Theory, vol. IT-2, pp. 8-19, September 1956.
  • J. P. M. Schalkwijk and T. Kailath, ``A coding scheme for additive noise channels with feedback--I: No bandwidth constraint,'' IEEE Trans. Inf. Theory, vol. IT-12, pp. 172-182, April 1966.
  • J. P. M. Schalkwijk, ``A coding scheme for additive noise channels with feedback--II: Band-limited signals,'' IEEE Trans. Inf. Theory, vol. IT-12, pp. 183-189, April 1966.
  • J. P. M. Schalkwijk, ``Center-of-gravity information feedback,'' IEEE Trans. Inf. Theory, vol. IT-14, pp. 324-331, March 1968.
  • S. A. Butman, ``A general formulation of linear feedback communication systems with solutions,'' IEEE Trans. Inf. Theory, vol. IT-15, pp. 392-400, May 1969.
  • N. T. Gaarder and J. K. Wolf, ``The capacity region of a multiple-access discrete memoryless channel can increase with feedback,'' IEEE Trans. Inf. Theory, vol. IT-21, pp. 100-102, January 1975.
  • A. El Gamal, ``The feedback capacity of degraded broadcast channels,'' IEEE Trans. Inf. Theory, vol. IT-24, pp. 379-381, May 1978.
  • H. Yamamoto and K. Itoh, ``Asymptotic performance of a modified Schalkwijk-Barron scheme for channels with noiseless feedback,'' IEEE Trans. Inf. Theory, vol. IT-25, no. 6, pp.729-733, Nov. 1979.
  • G. Dueck, ``Partial feedback for two-way and broadcast channels,'' Inform. Contr., vol. 46, no. 1, pp. 1-15, July 1980.
  • T. M. Cover and C. S. K. Leung, ``An achievable rate region for the multiple-access channel with feedback,'' IEEE Trans. Inf. Theory, vol. IT-27, pp. 292-298, May 1981.
  • A. El Gamal, ``The capacity of the physically degraded Gaussian broadcast channel with feedback,'' IEEE Trans. Inf. Theory, vol. IT-27, pp. 508-511, July 1981.
  • F. M. J. Willems, ``The feedback capacity region of a class of discrete memoryless multiple access channels,'' IEEE Trans. Inf. Theory, vol. IT-28, pp. 93-95, January 1982.
  • A. B. Carleial, ``Multiple-access channels with different generalized feedback signals,'' IEEE Trans. Inf. Theory, vol. IT-28, pp. 841-850, November 1982.
  • F. M. J. Willems and E. C. van der Meulen, ``Partial feedback for the discrete memoryless multiple access channel,'' IEEE Trans. Inf. Theory, vol. IT-29, pp. 287-290, March 1983.
  • L. H. Ozarow, ``The capacity of the white Gaussian multiple access channel with feedback,'' IEEE Trans. Inf. Theory, vol. IT-30, pp. 623-629, July 1984.
  • L. H. Ozarow and S. K. Leung-Yan-Cheong, ``An achievable region and outer bound for the Gaussian broadcast channel with feedback,'' IEEE Trans. Inf. Theory, vol. IT-30, pp. 667-671, July 1984.
  • T. M. Cover and S. Pombra, ``Gaussian feedback capacity,'' IEEE Trans. Inf. Theory, vol. IT-35, pp. 37-43, January 1989.
  • J. L. Massey, ``Causality, feedback, and directed information,'' Proc. Intl. Symp. Inf. Theory Applic., Waikiki, Hawaii, Nov., 1990. (pdf)
  • F. Alajaji, ``Feedback does not increase the capacity of discrete channels with additive noise,'' IEEE Trans. Inf. Theory, vol. IT-41, pp. 546-549, March 1995.
  • E. Ordentlich, ``On the factor-of-two bound for Gaussian multiple-access channels with feedback,'' IEEE Trans. Inf. Theory, vol. IT-42, pp. 2231-2235, November 1996.
  • J. M. Ooi and G. W. Wornell, ``Fast iterative coding techniques for feedback channels,'' IEEE Trans. Inf. Theory, vol. IT-44, no. 7, pp. 2960-2976, 1998.
  • Y.-H. Kim, ``Feedback capacity of stationary Gaussian channels,'' submitted to IEEE Trans. Inf. Theory, February 2006. (arXiv:cs/0602091)
  • H. Permuter, T. Weissman, and A. Goldsmith, ``Finite-state channels with time-invariant deterministic feedback,'' submitted to IEEE Trans. Inf. Theory, 2006. (arXiv:cs/0608070)
  • S. Tatikonda and S. Mitter, ``The capacity of channels with feedback,'' Sep. 2006. (arXiv:cs/0609139)
  • Y.-H. Kim, ``A coding theorem for a class of stationary channels with feedback,'' submitted to IEEE Trans. Inf. Theory, January 2007. (arXiv:cs/0701041)
Two-way Channel:
  • C. E. Shannon, ``Two-way communication channels,'' in Proc. 4th Berkeley Symp. Probab. Statistics, vol. I, pp. 611-644, 1961.
  • J. P. M. Schalkwijk, ``The binary multiplying channel--A coding scheme that operates beyond Shannon's inner bound region,'' IEEE Trans. Inf. Theory, vol. IT-28, pp. 107-110, January 1982.
  • J. P. M. Schalkwijk, ``On an extension of an achievable rate region for the binary multiplying channel,'' IEEE Trans. Inf. Theory, vol. IT-29, pp. 445-448, May 1983.
  • Z. Zhang, T. Berger, and J. P. M. Schalkwijk, ``New outer bounds to capacity regions of two-way channels,'' IEEE Trans. Info. Theory, vol. IT-32, pp. 383-386, May 1986.
  • A. P. Hekstra and F. M. J. Willems, ``Dependence balance bounds for single-output two-way channels,'' IEEE Trans. Inf. Theory, vol. IT-35, pp. 44-53, January 1989.
Capacity of Networks:
  • P. Gupta and P. R. Kumar, ``The capacity of wireless networks,'' IEEE Trans. Inf. Theory, vol. IT-46, pp. 388-404, Mar. 2000.
  • M. Grossglauser and D. Tse, ``Mobility increases the capacity of ad-hoc wireless networks,'' IEEE/ACM Trans. Networking, vol. 10, pp. 477-486, Aug. 2002.
  • P. Gupta and P. R. Kumar, ``Towards an information theory of large networks: An achievable rate region,'' IEEE Trans. Inf. Theory, vol. IT-49, pp. 1877-1894, Aug. 2003.
  • L.-L. Xie and P. R. Kumar, `` A network information theory for wireless communication: scaling laws and optimal operation,'' IEEE Trans. Inf. Theory, vol. IT-50, pp. 748-767, May 2004. (pdf)
  • O. Leveque and I. E. Telatar, `` Information-theoretic upper bounds on the capacity of large extended ad hoc wireless networks,'' IEEE Trans. Inf. Theory, vol. IT-51, pp. 858-865, Mar. 2005.
  • A. El Gamal, J. Mammen, B. Prabhakar, and D. Shah, ``Optimal hroughput-delay scaling in wireless networks--I: The fluid model'', IEEE Trans. Inf. Theory, vol. IT-52, pp. 2568-2592, June 2006.
  • O. Dousse, M. Franceschetti, and P. Thiran, ``On the throughput scaling of wireless relay networks,'' IEEE Trans. Inf. Theory, vol. IT-52, pp. 2756-2761, June 2006.
  • A. El Gamal, J. Mammen, B. Prabhakar, and D. Shah, ``Optimal throughput-delay scaling in wireless networks--II: Constant-sized packets'', IEEE Trans. Inf. Theory, vol. IT-52, pp. 5111-5116, Nov. 2006.
  • M. Franceschetti, O. Dousse, D. Tse, and P. Thiran, ``Closing the gap in the capacity of wireless networks via percolation theory,'' IEEE Trans. Inf. Theory, vol. IT-53, pp. 1009-1018, March 2007.
  • A. Ozgur, O. Leveque, and D. Tse, ``Hierarchical cooperation achieves optimal capacity scaling in ad hoc networks,'' submitted to IEEE Trans. Inf. Theory. (arXiv:cs/0611070)
Rate Distortion Theory:
  • C. E. Shannon, ``Coding theorems for a discrete source with a fidelity criterion,'' IRE Nat. Conv. Rec., part 4, pp. 142-163, 1959.
  • R. M. Gray and L. D. Davisson, ``Source coding theorems without the ergodic assumption,'' IEEE Trans. Inf. Theory, vol. IT-20, pp. 502-516, July 1974.
  • H. S. Witsenhausen, ``Indirect rate distortion problems,'' IEEE Trans. Inf. Theory, vol. IT-26, pp. 518-521, September 1980.
  • J. C. Kieffer, ``A survey of the theory of source coding with a fidelity criterion,'' IEEE Trans. Inf. Theory, vol. IT-39, pp. 1473 - 1490, September 1993.
  • T. Berger and J. D. Gibson, ``Lossy Source Coding,'' IEEE Trans. Inf. Theory, vol. IT-44, pp. 2693-2723, October 1998.
  • M. Gastpar, B. Rimoldi, and M. Vetterli, ``To code, or not to code: Lossy source-channel communication revisited,'' IEEE Trans. Inf. Theory, vol. IT-49, pp. 1147-1158, May 2003.
Multiple Descriptions:
  • H. S. Witsenhausen, ``On source networks with minimal breakdown degradation,'' Bell Syst. Tech. J., vol. 59, no. 6, pp. 1083-1087, July-August 1980. (pdf)
  • J. K. Wolf, A. D. Wyner, and J. Ziv, ``Source coding for multiple descriptions,'' Bell Syst. Tech. J., vol. 59, no. 8, pp. 1417-1426, Oct. 1980. (pdf)
  • L. H. Ozarow, ``On a source coding problem with two channels and three receivers,'' Bell Syst. Tech. J., vol. 59, pp. 1909-1921, Dec. 1980. (pdf)
  • H. S. Witsenhausen and A. D. Wyner, ``Source coding for multiple descriptions--II: A binary source,'' Bell Syst. Tech. J., vol. 60, no. 10, pp. 2281-2292, Dec. 1981. (pdf)
  • Witsenhausen, ``On team guessing with independent information,'' Math. Oper. Res., vol. 6, no. 2, pp. 293-304, 1981. (JSTOR)
  • A. El Gamal and T. M. Cover, ``Achievable rates for multiple descriptions,'' IEEE Trans. Inf. Theory, vol. IT-28, pp. 851-857, November 1982.
  • R. Ahlswede, ``The rate-distortion region for multiple descriptions without excess rate,'' IEEE Trans. Inf. Theory, vol. IT-31, pp. 721-726, November 1985.
  • R. F. Ahlswede, ``On multiple descriptions and team guessing,'' IEEE Trans. Inf. Theory, vol. IT-32, pp. 543-549, July 1986.
  • Z. Zhang and T. Berger, ``New results in binary multiple descriptions,'' IEEE Trans. Inf. Theory, vol. IT-33, pp. 502-521, July 1987.
  • W. H. R. Equitz and T. M. Cover, ``Successive refinement of information,'' IEEE Trans. Inf. Theory, vol. IT-37, pp. 269-275, March 1991.
  • W. H. R. Equitz and T. M. Cover, ``Addendum to 'Successive refinement of information' (Mar 91 269-275),'' IEEE Trans. Inf. Theory, vol. IT-39, pp. 1465-1466, July 1993.
  • B. E. Rimoldi, ``Successive refinement of information: characterization of the achievable rates,'' IEEE Trans. Inf. Theory, vol. IT-40, pp. 253-259, January 1994.
  • Z. Zhang and T. Berger, ``Multiple description source coding with no excess marginal rate,'' IEEE Trans. Inf. Theory, vol. IT-41, pp. 349-357, March 1995.
  • R. Zamir, ``Gaussian codes and Shannon bounds for multiple descriptions,'' IEEE Trans. Inf. Theory, vol. IT-45, pp. 2629-2636, November 1999.
  • F.-W. Fu and R. W. Yeung, ``On the rate-distortion region for multiple descriptions,'' IEEE Trans. Inf. Theory, vol. IT-48, pp. 2012-2021, July 2002.
  • R. Venkataramani, G. Kramer, and V. K. Goyal, ``Multiple description coding with many channels,'' IEEE Trans. Inf. Theory, vol. IT-49, pp. 2106-2114, September 2003.
Source Coding with Side Information:
  • A. D. Wyner, ``On source coding with side information at the decoder,'' IEEE Trans. Inf. Theory, vol. IT-21, pp. 294-300, May 1975.
  • R. F. Ahlswede and J. Korner, ``Source coding with side information and a converse for degraded broadcast channels,'' IEEE Trans. Inf. Theory, vol. IT-21, pp. 629-637, November 1975.
  • A. D. Wyner and J. Ziv, ``The rate-distortion function for source coding with side information at the decoder,'' IEEE Trans. Inf. Theory, vol. IT-22, pp. 1-10, January 1976.
  • A. D. Wyner, ``The rate-distortion function for source coding with side information at the decoder--II. General sources,'' Inform. Contr., vol. 38, pp. 60-80, 1978.
  • T. Berger, K. B. Housewright, J. K. Omura, S. Y. Yung, and J. Wolfowitz, "An upper bound on the rate distortion function for source coding with partial side information at the decoder," IEEE Trans. Inf. Theory, vol. IT-25, pp. 664-666, November 1979.
  • H. Yamamoto, ``Wyner-Ziv theory for a general function of the correlated sources,'' IEEE Trans. Inf. Theory, vol. IT-28, no. 5, pp. 803-807, Sep. 1982. (pdf)
  • R. Ahlswede and T. S. Han, ``On source coding with side information via a multiple-access channel and related problems in multi-user information theory,'' IEEE Trans. Inf. Theory, vol. IT-29, pp. 396-412, May 1983. (pdf)
  • C. D. Heegard and T. Berger, ``Rate distortion when side information may be absent,'' IEEE Trans. Inf. Theory, vol. IT-31, pp. 727 - 734, November 1985.
  • A. H. Kaspi, ``Rate-distortion function when side-information may be present at the decoder,'' IEEE Trans. Inf. Theory, vol. IT-40, pp. 2031-2034, November 1994.
  • S. C. Draper and G. W. Wornell, ``Side information aware coding strategies for sensor networks,'' IEEE J. Select. Areas Commun., vol. 22, pp. 966-976, Aug 2004.
  • Y. Oohama, ``Rate-distortion theory for Gaussian multiterminal source coding systems with several side informations at the decoder,'' IEEE Trans. Inf. Theory, vol. IT-51, no. 7, pp. 2577-2593, July 2005.
  • A. Wagner, S. Tavildar, and P. Viswanath, ``Rate region of the quadratic Gaussian two-terminal source-coding problem.'' submitted to IEEE Trans. Inf. Theory. (arXiv:cs/0510095)
Multiterminal Source Coding:
  • D. Slepian and J. K. Wolf, ``Noiseless coding of correlated information sources,'' IEEE Trans. Inf. Theory, vol. IT-19, pp. 471-480, July 1973. (pdf)
  • T. M. Cover, ``A proof of the data compression theorem of Slepian and Wolf for ergodic sources,'' IEEE Trans. Inf. Theory, vol. IT-21, pp. 226-228, March 1975. (pdf)
  • R. M. Gray and A. D. Wyner, ``Source coding over simple networks,'' Bell Systems Tech. J., vol. 53, no. 9, pp. 1681-1721, Nov. 1974.
  • T. Berger and S.-Y. Tung, ``Encoding of correlated analog sources,'' in Proc. IEEE-USSR Joint Workshop on Information Theory, pp. 7-10, 1975.
  • A. D. Wyner, ``On source coding with side information at the decoder,'' IEEE Trans. Inf. Theory, vol. IT-21, pp. 294-300, May 1975.
  • R. F. Ahlswede and J. Korner, ``Source coding with side information and a converse for degraded broadcast channels,'' IEEE Trans. Inf. Theory, vol. IT-21, pp. 629-637, November 1975.
  • A. D. Wyner and J. Ziv, ``The rate-distortion function for source coding with side information at the decoder,'' IEEE Trans. Inf. Theory, vol. IT-22, pp. 1-10, January 1976.
  • T. Berger, ``Multiterminal source coding,'' in The Information Theory Approach to Communications (CISM Lecture Notes, no. 229), edited by G. Longo, Springer-Verlag, Vienna, 1978, pp. 171-231. (pdf)
  • A. D. Wyner, ``The rate-distortion function for source coding with side information at the decoder--II. General sources,'' Inform. Contr., vol. 38, pp. 60-80, 1978.
  • S.-Y. Tung, ``Multiterminal source coding (Ph.D. Thesis abstract),'' IEEE Trans. Inf. Theory, vol. IT-24, p. 787, November 1978.
  • H. Yamamoto and K. Itoh, ``Source coding theory for multiterminal communication systems with a remote source,'' Trans. IECE Japan, vol. E63, no. 10, pp. 700--706, October 1980. (pdf)
  • A. H. Kaspi and T. Berger, ``Rate-distortion for correlated sources with partially separated encoders,'' IEEE Trans. Inf. Theory, vol. IT-28, pp. 828-840, November 1982.
  • R. Ahlswede and T. S. Han, ``On source coding with side information via a multiple-access channel and related problems in multi-user information theory,'' IEEE Trans. Inf. Theory, vol. IT-29, pp. 396-412, May 1983. (pdf)
  • T. J. Flynn and R. M. Gray, ``Encoding of correlated observations,'' IEEE Trans. Inf. Theory, vol. IT-33, pp. 773 - 787, November 1987.
  • T. Berger and R. W. Yeung, ``Multiterminal source encoding with one distortion criterion,'' IEEE Trans. Inf. Theory, vol. IT-35, pp. 228-236, March 1989.
  • T. Berger and R. W. Yeung, ``Multiterminal source encoding with encoder breakdown,'' IEEE Trans. Inf. Theory, vol. IT-35, pp. 237-244, March 1989.
  • T. Berger, Z. Zhang, and H. Viswanathan, ``The CEO problem'', IEEE Trans. Inf. Theory, vol. IT-42, no. 3, pp. 887-902, May 1996.
  • H. Viswanathan and T. Berger, ``The quadratic Gaussian CEO problem,'' IEEE Trans. Inf. Theory, vol. IT-43, pp. 1549-1559, Sep. 1997.
  • Y. Oohama, ``Gaussian multiterminal source coding,'' IEEE Trans. Inf. Theory, vol. IT-43, pp. 1912-1923, November 1997.
  • Y. Oohama, ``The rate-distortion function for the quadratic Gaussian CEO problem,'' IEEE Trans. Inf. Theory, vol. IT-44, no. 3, pp. 1057-1070, May 1998.
  • T. Linder, R. Zamir, and K. Zeger, ``On source coding with side-information-dependent distortion measures,'' IEEE Trans. Inf. Theory, vol. IT-46, pp. 2697-2704, November 2000. (pdf)
  • V. Prabhakaran, D. Tse, and K. Ramchandran, ``Rate region of the quadratic CEO problem,'' in Proc. IEEE Int. Symp. Inf. Theory, Chicago, IL, June/July 2004.
  • S. C. Draper and G. W. Wornell, ``Side information aware coding strategies for sensor networks,'' IEEE J. Select. Areas Commun., vol. 22, pp. 966-976, Aug 2004.
  • Y. Oohama, ``Rate-distortion theory for Gaussian multiterminal source coding systems with several side informations at the decoder,'' IEEE Trans. Inf. Theory, vol. IT-51, no. 7, pp. 2577-2593, July 2005.
  • A. Wagner, S. Tavildar, and P. Viswanath, ``Rate region of the quadratic Gaussian two-terminal source-coding problem.'' submitted to IEEE Trans. Inf. Theory. (arXiv:cs/0510095)
Channels with State:
  • C. E. Shannon, ``Channels with side information at the transmitter,'' IBM J. Res. Devel., vol. 2, pp. 289-293, Oct. 1958. (IBM)
  • A. V. Kusnetsov and B. S. Tsybakov, ``Coding in a memory with defective cells,'' Prob. Peredach. Inform., vol. 10, no. 2, pp. 52-60, Apr./Jun. 1974.
  • S. I. Gelfand and M. S. Pinsker, ``Coding for channel with random parameters,'' Prob. Contr. Inform. Theory, vol. 9, no. 1, pp. 19-31, 1980.
  • C. D. Heegard and A. A. El Gamal, ``On the capacity of computer memory with defects,'' IEEE Trans. Inf. Theory, vol. IT-29, pp. 731-739, September 1983.
  • G. Caire and S. Shamai, ``On the capacity of some channels with channel state information,'' IEEE Trans. Inf. Theory, vol. IT-45, no. 6, pp. 2007-2019, 1999.
  • M. H. M. Costa, ``Writing on dirty paper,'' IEEE Trans. Inf. Theory, vol. IT-29, pp. 439-441, May 1983.
  • T. M. Cover and M. Chiang, ``Duality between channel capacity and rate distortion with two-sided state information,'' IEEE Trans. Inf. Theory, vol. IT-48, pp. 1629-1638, June 2002.
  • A. S. Cohen and A. Lapidoth, ``The Gaussian watermarking game,'' IEEE Trans. Inf. Theory, vol. IT-48, pp. 1639-1667, June 2002.
  • N. Merhav and S. Shamai, ``On joint source-Channel coding for the Wyner-Ziv source and the Gel'fand--Pinsker channel,'' IEEE Trans. Inf. Theory, vol. IT-49, pp. 2844-2855, November 2003.
  • P. Moulin and J. A. O'Sullivan, ``Information-theoretic analysis of information hiding,'' IEEE Trans. Inf. Theory, vol. IT-49, pp. 563-593, March 2003.
  • U. Erez, S. Shamai, and R. Zamir, ``Capacity and lattice strategies for canceling known interference,'' IEEE Trans. Inf. Theory, vol. IT-51, no. 11, pp. 3820-3833, 2005.
  • U. Erez and S. ten Brink, ``A close-to-capacity dirty paper coding scheme,'' IEEE Trans. Inf. Theory, vol. IT-51, no. 10, pp. 3417-3432, 2005.
  • S. A. Jafar, ``Capacity with causal and noncausal side information: a unified view,'' IEEE Trans. Inf. Theory, vol. IT-52, no. 12, pp. 5468-5474, 2006.
  • N. Merhav and S. Shamai, ``Information rates subjected to state masking,'' submitted to IEEE Trans. Inf. Theory, 2006. (pdf)
  • T. M. Cover, Y.-H. Kim, A. Sutivong, ``Simultaneous communication of data and state,'' submitted to IEEE Trans. Inf. Theory. (arXiv:cs/0703005)
Network Coding:
Zero-error Information Theory:
Common Information:
Identification via Channels:
Information Theory and Secrecy:
Last modified: Tue May 22 21:18:44 PDT 2007