Stanford EE 478 / UCSD ECE 287A: References on Network Information Theory
We won't attempt to give a complete coverage of the literature, but will sample a few key papers and review articles.
Introduction:
  1. T. C. Hu, "Multi-commodity network flows," Operations Research, vol. 11, no. 3, pp. 344-360, 1963. (pdf)
  2. L. R. Ford, Jr. and D. R. Fulkerson, "Maximal flow through a network," Canad. J. Math., vol. 8, pp. 399-404, 1956. (link)
  3. P. Elias, A. Feinstein, and C. E. Shannon, "A note on the maximum flow through a network," IRE Trans. Inf. Theory, vol. IT-2, no. 4, pp. 117-119, December 1956. (pdf)
  4. C. E. Shannon, "A mathematical theory of communication," Bell System Tech. J., vol. 27, pp. 379-423, 623-656, 1948. (pdf)
  5. C. E. Shannon, "Coding theorems for a discrete source with a fidelity criterion," In IRE Int. Conv. Rec., part 4, vol. 7, 1959, pp. 142-163, Reprinted with changes in Information and Decision Processes, R. E. Machol, Ed. New York: McGraw-Hill, 1960, pp. 93-126.
  6. C. E. Shannon, "Two-way communication channels," In Proc. 4th Berkeley Sympos. Math. Statist. Prob., vol. I, Univ. California Press, Berkeley, Calif., 1961, pp. 611-644. (link)
Preliminaries:
  1. C. E. Shannon, "A mathematical theory of communication," Bell System Tech. J., vol. 27, pp. 379-423, 623-656, 1948. (pdf)
  2. A. J. Stam, "Some inequalities satisfied by the quantities of information of Fisher and Shannon," Inf. Control, vol. 2, pp. 101-112, 1959. (pdf)
  3. N. M. Blachman, "The convolution inequality for entropy powers," IEEE Trans. Inf. Theory, vol. IT-11, pp. 267-271, 1965. (pdf)
  4. M. S. Pinsker, Information and Information Stability of Random Variables and Processes, Holden-Day, San Francisco, 1964.
  5. B. McMillan, "The basic theorems of information theory," Ann. Math. Statist., vol. 24, pp. 196-219, 1953.
  6. L. Breiman, "The individual ergodic theorem of information theory," Ann. Math. Statist., vol. 28, pp. 809-811, 1957, with correction in Ann. Math. Statist., vol. 31, pp. 809-810, 1960.
  7. A. R. Barron, "The strong ergodic theorem for densities: Generalized Shannon-McMillan-Breiman theorem," Ann. Probab., vol. 13, no. 4, pp. 1292-1303, 1985.
  • H. S. Witsenhausen, "Entropy inequalities for discrete channels," IEEE Trans. Inf. Theory, vol. IT-20, pp. 610-616, 1974. (pdf)
  • H. S. Witsenhausen and A. D. Wyner, "A conditional entropy bound for a pair of discrete random variables," IEEE Trans. Inf. Theory, vol. IT-21, no. 5, pp. 493-501, 1975.
  • R. Ahlswede, P. Gács, and J. Körner, "Bounds on conditional probabilities with applications in multi-user communication," Probab. Theory Related Fields, vol. 34, no. 2, pp. 157-177, 1976, Correction in Probab. Theory Related Fields, vol. 39, no. 4, pp. 353-354, 1977. (link)
  • R. Ahlswede and J. Körner, "On the connection between the entropies of input and output distributions of discrete memoryless channels," In Proceedings of the Fifth Conference on Probability Theory (Bra c sov, 1974), Editura Acad. R.S.R., Bucharest, 1977, pp. 13-22. (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," IEEE Trans. Inf. Theory, vol. IT-53, no. 5, pp. 1839-1851, May 2007. (pdf)
Point-to-Point Information Theory:
  1. C. E. Shannon, "A mathematical theory of communication," Bell System Tech. J., vol. 27, pp. 379-423, 623-656, 1948. (pdf)
  2. A. Feinstein, "A new basic theorem of information theory," IRE Trans. Inf. Theory, vol. IT-4, pp. 2-22, 1954. (pdf)
  3. R. G. Gallager, "A simple derivation of the coding theorem and some applications," IEEE Trans. Inf. Theory, vol. IT-11, pp. 3-18, 1965. (pdf)
  4. R. G. Gallager, Information Theory and Reliable Communication, Wiley, New York, 1968.
  5. R. G. Gallager, Low-Density Parity-Check Codes, MIT Press, Cambridge, MA, 1963.
  6. T. Richardson and R. Urbanke, Modern Coding Theory, Cambridge University Press, New York, 2008.
  7. R. J. McEliece, The Theory of Information and Coding, Addison-Wesley, Reading, MA, 1977.
  8. A. D. Wyner, "The capacity of the band-limited Gaussian channel," Bell System Tech. J., vol. 45, pp. 359-395, March 1966. (pdf)
  9. M. J. E. Golay, "Note on the theoretical efficiency of information reception with PPM," Proc. IRE, vol. 37, no. 9, pp. 1031, September 1949. (pdf)
  10. S. Verdú, "On channel capacity per unit cost," IEEE Trans. Inf. Theory, vol. IT-36, no. 5, pp. 1019-1030, 1990. (pdf)
  11. C. E. Shannon, "Coding theorems for a discrete source with a fidelity criterion," In IRE Int. Conv. Rec., part 4, vol. 7, 1959, pp. 142-163, Reprinted with changes in Information and Decision Processes, R. E. Machol, Ed. New York: McGraw-Hill, 1960, pp. 93-126.
  12. 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, no. 5, pp. 1147-1158, 2003. (pdf)
  • D. Slepian, ``On bandwidth,'' Proc. IEEE, vol. 64, no. 3, pp. 292-300, March 1976. (pdf)
  • 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.
Distributed Lossless Source Coding:
  1. D. Slepian and J. K. Wolf, "Noiseless coding of correlated information sources," IEEE Trans. Inf. Theory, vol. IT-19, pp. 471-480, 1973. (pdf)
  2. T. M. Cover, "A proof of the data compression theorem of Slepian and Wolf for ergodic sources," IEEE Trans. Inf. Theory, vol. IT-21, no. 2, pp. 226-228, March 1975. p(pdf)
Multiple Access Channel:
  1. R. Ahlswede, "Multiway communication channels," In Proc. 2nd Int. Symp. Inf. Theory, Tsahkadsor, Armenian S.S.R., 1971, pp. 23-52. (pdf)
  2. H. H. J. Liao, Multiple Access Channels, Ph.d. thesis, University of Hawaii, Honolulu, September 1972. (pdf)
  3. G. Dueck, "Maximal error capacity regions are smaller than average error capacity regions for multi-user channels," Probl. Control Inf. Theory, vol. 7, no. 1, pp. 11-19, 1978.
  4. T. M. Cover, "Some advances in broadcast channels," In A. J. Viterbi, editor, Advances in Communication Systems, vol. 4, Academic Press, San Francisco, 1975, pp. 229-260. (pdf)
  5. A. D. Wyner, "Recent results in the Shannon theory," IEEE Trans. Inf. Theory, vol. IT-20, pp. 2-10, 1974. (pdf)
  6. T. M. Cover, A. El Gamal, and M. Salehi, "Multiple access channels with arbitrarily correlated sources," IEEE Trans. Inf. Theory, vol. IT-26, no. 6, pp. 648-657, November 1980. (pdf)
  7. H. S. Witsenhausen, "On sequences of pairs of dependent random variables," SIAM J. Appl. Math., vol. 28, pp. 100-113, 1975. (link)
  8. G. Dueck, "A note on the multiple access channel with correlated sources," IEEE Trans. Inf. Theory, vol. IT-27, no. 2, pp. 232-235, 1981. (pdf)
  • H. G. Eggleston, ``Proof of Caratheordory's theorem,'' in Convexity, Cambridge University Press, Cambridge, 1969. (pdf)
  • 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.
  • 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)
Broadcast Channel:
  1. J. Körner and K. Marton, "General broadcast channels with degraded message sets," IEEE Trans. Inf. Theory, vol. IT-23, no. 1, pp. 60-64, 1977. (pdf)
  2. T. M. Cover, "Broadcast channels," IEEE Trans. Inf. Theory, vol. IT-18, no. 1, pp. 2-14, January 1972. (pdf)
  3. R. G. Gallager, "Capacity and coding for degraded broadcast channels," Probl. Inf. Transm., vol. 10, no. 3, pp. 3-14, 1974. (pdf)
  4. A. D. Wyner, "A theorem on the entropy of certain binary sequences and applications—II," IEEE Trans. Inf. Theory, vol. IT-19, pp. 772-777, 1973.
  5. P. P. Bergmans, "Random coding theorem for broadcast channels with degraded components," IEEE Trans. Inf. Theory, vol. IT-19, no. 2, pp. 197-207, 1973. (pdf)
  6. P. P. Bergmans, "A simple converse for broadcast channels with additive white Gaussian noise," IEEE Trans. Inf. Theory, vol. IT-20, pp. 279-280, 1974. (pdf)
  7. J. Körner and K. Marton, "Comparison of two noisy channels," In Topics in Information Theory (Second Colloq., Keszthely, 1975), North-Holland, Amsterdam, 1977, pp. 411-423.
  8. A. El Gamal, "The capacity of a class of broadcast channels," IEEE Trans. Inf. Theory, vol. IT-25, no. 2, pp. 166-169, 1979. (pdf)
  9. G. S. Poltyrev, "The capacity of parallel broadcast channels with degraded components," Probl. Inf. Transm., vol. 13, no. 2, pp. 23-35, 1977.
  10. G. S. Poltyrev, "Capacity for a sum of broadcast channels," Probl. Inf. Transm., vol. 15, no. 2, pp. 40-44, 1979.
  11. A. El Gamal, "Capacity of the product and sum of two unmatched broadcast channels," Probl. Inf. Transm., vol. 16, no. 1, pp. 3-23, 1980.
  12. T. M. Cover, "An achievable rate region for the broadcast channel," IEEE Trans. Inf. Theory, vol. IT-21, pp. 399-404, 1975. (pdf)
  13. 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, 1975. (pdf)
  14. K. Marton, "A coding theorem for the discrete memoryless broadcast channel," IEEE Trans. Inf. Theory, vol. IT-25, no. 3, pp. 306-311, 1979. (pdf)
  15. 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, no. 1, pp. 120-122, January 1981. (pdf)
  16. S. I. Gelfand and M. S. Pinsker, "Capacity of a broadcast channel with one deterministic component," Probl. Inf. Transm., vol. 16, no. 1, pp. 24-34, 1980.
  17. H. Weingarten, Y. Steinberg, and S. Shamai, "The capacity region of the Gaussian multiple-input multiple-output broadcast channel," IEEE Trans. Inf. Theory, vol. IT-52, no. 9, pp. 3936-3964, September 2006. (pdf)
  18. 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)
  19. H. Satô, "An outer bound to the capacity region of broadcast channels," IEEE Trans. Inf. Theory, vol. IT-24, no. 3, pp. 374-377, 1978. (pdf)
  20. C. Nair and A. El Gamal, "The capacity region of a class of 3-receiver broadcast channels with degraded message sets," 2008.
  21. R. F. Ahlswede and J. Körner, "Source coding with side information and a converse for degraded broadcast channels," IEEE Trans. Inf. Theory, vol. IT-21, no. 6, pp. 629-637, 1975.
  22. I. Csiszár and J. Körner, "Broadcast channels with confidential messages," IEEE Trans. Inf. Theory, vol. IT-24, no. 3, pp. 339-348, 1978. (pdf)
  • P. P. Bergmans and T. M. Cover, ``Cooperative broadcasting,'' IEEE Trans. Inf. Theory, vol. IT-20, pp. 317-324, May 1974. (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, ``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)
  • 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)
  • 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. 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)
Interference Channel:
  1. H. Satô, "Two-user communication channels," IEEE Trans. Inf. Theory, vol. IT-23, no. 3, pp. 295-304, 1977. (pdf)
  2. A. B. Carleial, "A case where interference does not reduce capacity," IEEE Trans. Inf. Theory, vol. IT-21, no. 5, pp. 569-570, 1975. (pdf)
  3. H. Satô, "The capacity of the Gaussian interference channel under strong interference," IEEE Trans. Inf. Theory, vol. IT-27, no. 6, pp. 786-788, November 1981. (pdf)
  4. 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, no. 5, pp. 710-711, 1987. (pdf)
  5. T. S. Han and K. Kobayashi, "A new achievable rate region for the interference channel," IEEE Trans. Inf. Theory, vol. IT-27, no. 1, pp. 49-60, 1981. (pdf)
  6. H.-F. Chong, M. Motani, H. K. Garg, and H. El Gamal, "On the Han-Kobayashi region for the interference channel," IEEE Trans. Inf. Theory, vol. IT-54, no. 7, pp. 3188-3195, July 2008. (pdf)
  7. R. Etkin, D. Tse, and H. Wang, "Gaussian interference channel capacity to within one bit," submitted to IEEE Trans. Inf. Theory, 2007.
  8. I. E. Telatar and D. N. C. Tse, "Bounds on the capacity region of a class of interference channels," In Proc. IEEE International Symposium on Information Theory, Nice, France, June 2007. (pdf)
  9. X. Shang, G. Kramer, and B. Chen, "A new outer bound and the noisy-interference sum-rate capacity for Gaussian interference channels," submitted to IEEE Trans. Inf. Theory, Dec. 2007.
  10. V. S. Annapureddy and V. V. Veeravalli, "Gaussian interference networks: Sum capacity in the low interference regime and new outer bounds on the capacity region," submitted to IEEE Trans. Inf. Theory, Feb. 2008.
  11. A. S. Motahari and A. K. Khandani, "Capacity bounds for the Gaussian interference channel," submitted to IEEE Trans. Inf. Theory, Jan. 2008.
  12. G. M. Ziegler, Lectures on Polytopes, Springer-Verlag, New York, 1995.
  • 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)
  • 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)
  • 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)
Source Coding with Side Information:
  1. 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, no. 1, pp. 1-10, 1976. (pdf)
  2. T. Berger, "Multiterminal source coding," In G. Longo, editor, The Information Theory Approach to Communications, Springer-Verlag, New York, 1978.
  3. R. F. Ahlswede and J. Körner, "Source coding with side information and a converse for degraded broadcast channels," IEEE Trans. Inf. Theory, vol. IT-21, no. 6, pp. 629-637, 1975. (pdf)
  4. A. D. Wyner, "On source coding with side information at the decoder," IEEE Trans. Inf. Theory, vol. IT-21, pp. 294-300, 1975.
  5. R. M. Gray and A. D. Wyner, "Source coding for a simple network," Bell System Tech. J., vol. 53, pp. 1681-1721, 1974. (pdf)
  6. A. D. Wyner, "The common information of two dependent random variables," IEEE Trans. Inf. Theory, vol. IT-21, no. 2, pp. 163-179, March 1975. (pdf)
  7. S.-Y. Tung, Multiterminal Source Coding, Ph.d. thesis, Cornell University, Ithaca, NY, 1978.
  • 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)
  • 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)
Multiple Descriptions:
  1. A. El Gamal and T. M. Cover, "Achievable rates for multiple descriptions," IEEE Trans. Inf. Theory, vol. IT-28, no. 6, pp. 851-857, 1982. (pdf)
  2. R. Ahlswede, "The rate-distortion region for multiple descriptions without excess rate," IEEE Trans. Inf. Theory, vol. IT-31, no. 6, pp. 721-726, 1985. (pdf)
  3. L. Ozarow, "On a source-coding problem with two channels and three receivers," Bell System Tech. J., vol. 59, no. 10, pp. 1909-1921, 1980. (pdf)
  4. Z. Zhang and T. Berger, "New results in binary multiple descriptions," IEEE Trans. Inf. Theory, vol. IT-33, no. 4, pp. 502-521, 1987. (pdf)
  5. T. Berger and Z. Zhang, "Minimum breakdown degradation in binary source encoding," IEEE Trans. Inf. Theory, vol. IT-29, no. 6, pp. 807-814, 1983. (pdf)
  6. W. H. R. Equitz and T. M. Cover, "Successive refinement of information," IEEE Trans. Inf. Theory, vol. IT-37, no. 2, pp. 269-275, 1991. (pdf)
  7. B. Rimoldi, "Successive refinement of information: Characterization of the achievable rates," IEEE Trans. Inf. Theory, vol. IT-40, no. 1, pp. 253-259, January 1994. (pdf)
  • 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)
  • 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. (pdf)
  • R. F. Ahlswede, ``On multiple descriptions and team guessing,'' IEEE Trans. Inf. Theory, vol. IT-32, pp. 543-549, July 1986. (pdf)
  • 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. (pdf)
  • R. Zamir, "Gaussian codes and shannon bounds for multiple descriptions," IEEE Trans. Inf. Theory, vol. IT-45, no. 7, pp. 2629-2636, November 1999. (pdf)
  • 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. (pdf)
  • R. Venkataramani, G. Kramer, and V. K. Goyal, "Multiple description coding with many channels," IEEE Trans. Inf. Theory, vol. IT-49, no. 9, pp. 2106-2114, September 2003. (pdf)
  • H. Wang and P. Viswanath, "Vector Gaussian multiple description with individual and central receivers," IEEE Trans. Inf. Theory, vol. IT-53, no. 6, pp. 2133-2153, June 2007. (pdf)
Last modified: Thu Jun 26 13:09:49 PDT 2008