Multiple User Information Theory

Proceedings of the IEEE

Volumn 68, Issue 12, 1980, Pages 1466-1483

  El Gamal, Abbas ^a   Cover, Thomas M ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION THEORY;

EID: 0019187817     PISSN: 00189219     EISSN: 15582256     Source Type: Journal    
DOI: 10.1109/PROC.1980.11897     Document Type: Article

References (165)

1. E. C. van der Meulen, “A survey of multi-way channels in information theory: 1961–1976,” IEEE Trans. Inform. Theory, vol. IT-23, no. 2, Jan. 1977.
2. R. Ahlswede, “Multi-way communication channels,” in Proc. 2nd Int. Symp. Inform. Theory (Tsahkadsor, Armenian S.S.R.), pp. 23–52, 1971. (Publishing House of the Hungarian Academy of Sciences, 1973.)
3. H. Liao, “Acoding theorem for multiple access communications,” presented at the Int. Symp. Information Theory, Asilomar, 1972. Also Ph.D. dissertation, “Multiple Access Channels,” Dep. Elec. Eng., Univ. Hawaii, Honuolulu, 1972.
4. L. R. Ford and D. R. Fulkerson, Flows in Networks. Princeton, NJ: Princeton Univ. Press, 1962.
5. A. D. Wyner, “The capacity of the band-limited Gaussian channel,” Bell Syst. Tech. J., vol. 45, pp. 359–371, Mar. 1965.
6. R. G. Gallager, Information Theory and Reliable Communication. New York: Wiley, 1968.
7. D. Slepian and H. O. Pollak, “Prolate spheroidal wave functions, Fourier analysis, and uncertainty—I,” Bell Syst. Tech. J., vol. 40, pp. 43–64. (Also see Landau and Pollak for Parts II and III.)
8. T. Cover, R. J. McEliece, and E. Posner, “Asymchronous multiple access channel capacity,” Tech. Rep. 35, Dep. Statistics, Stanford Univ., Stanford, CA, Dec. 1978. (To appear in IEEE Trans. Inform. Theory.)
9. A. B. Carleial, “A case where interference does not reduce capacity,” IEEE Trans. Inform. Theory, vol. IT-21, pp. 569–570, Sept. 1975.
10. C. E. Shannon, “A mathematical theory of communication,” Bell Syst. Tech. J., vol. 27, pp. 379–423 and 623–656, July and Oct. 1948.
11. B. McMillan, “The basic theorems of information theory,” Ann. Math. Stat., vol. 24, pp. 196–219, June 1953.
12. L. Breiman, “The individual ergodic theorem of information theory,” Ann. Math. Stat., vol. 28, pp. 809–811, 1960.
13. A. Feinstein, “A new basic theorem of information theory,” IRE Trans. Inform. Theory, vol. IT-4, pp. 2–22, Sept. 1954.
14. G. D. Forney, “Information theory,” unpublished course notes.
15. D. Slepian and J. W. Wolf, “Noiseless coding of correlated information sources,” IEEE Trans. Inform. Theory, vol. IT-19, pp. 471–480, July 1973.
16. T. M. Cover, “A proof of the data compression theorem of Slepian and Wolf for ergodic sources,” IEEE Trans. Inform. Theory, vol. IT-22, pp. 226–278, Mar. 1975.
17. T. Berger, “Multi-terminal source coding,” Lecture notes presented at the 1977 CISM Summer School, Udine, Italy, July 18–20, 1977.
18. T. Cover, A. El Gamal, and M. Salehi, “Multiple access channels with arbitrarily correlated sources,” to appear in the IEEE Trans. Inform. Theory.
19. T. Cover, “Broadcast channels,” IEEE Trans. Inform. Theory, vol. IT-18, pp. 2–14, Jan. 1972.
20. P. P. Bergmans, “Random coding theorem for broadcast channels with degraded components,” IEEE Trans. Inform. Theory, vol. IT-19, pp. 197–207, Mar. 1973.
21. R. G. Gallager, “Capacity and coding for degraded broadcast channels,” Problemy Peredaci Informaccii, vol. 10, no. 3, pp. 3–14, 1974.
22. K. Marton, “A coding theorem for the discrete memoryless broadcast channel,” IEEE Trans. Inform. Theory, vol. IT-25, pp. 306–311, May 1979.
23. P. Bergmans, “A simple converse for broadcast channels with additive white Gaussian noise,” IEEE Trans. Inform. Theory, p. 279, Mar. 1974.
24. J. Körner and K. Marton, “General broadcast channels with degraded message sets,” IEEE Trans. Inform. Theory, vol. IT-23, no. 1, Jan. 1977.
25. A. El Gamal, “The capacity of a class of broadcast channels,” IEEE Trans. Inform. Theory, vol. IT-25, pp. 166–169, Mar. 1979.
26. S. Gelfand, “Capacity of one broadcast channel,” Problems of Information Transmission, vol. 13, no. 3, 1977, pp. 240–242 (English translation).
27. M. Pinsker, “The capacity region of noiseless broadcast channels,” Problems of Information Transmission, vol. 14, no. 2, pp. 97–102, 1978 (English translation).
28. A. El Gamal, “The capacity of the product and sum of two inconsistently degraded broadcast channels,” Problems of Information Transmission, vol. 1, 1980.
29. A. El Gamal and E. van der Meulen, “A proof of Marton's coding theorem for the discrete memoryless broadcast channel,” to appear in IEEE Trans. on Inform. Theory.
30. A. El Gamal, “The feedback capacity of degraded broadcast channels,” IEEE Trans. Inform. Theory, vol. IT-24, no. 3, May 1978.
31. L. Ozarow, Ph.D. thesis, Massachusetts Institute of Technology, Cambridge, MA, June 1979.
32. G. Dueck, “Semi-feedback for multiple-user channels,” submitted for publication.
33. E. C. van der Meulen, “Three-terminal communication channels,” Adv. Appl. Prob., vol. 3, pp. 120–154, 1971.
34. T. Cover and A. El Gamal, “Capacity theorems for the relay channel,” IEEE Trans. Inform. Theory, vol. IT-25, no. 5, Sept. 1979.
35. A. El Gamal, “The capacity of the deterministic relay channel,” presented at the 1979 IEEE Int. Symp. Information Theory.
36. C. E. Shannon, “Two-way communication channels,” in Proc. 4th Berkeley Symp. Math. Stat. Prob., 1, Univ. California Press, pp. 611–644, 1961.
37. R. Ahlswede, “The capacity region of a channel with two senders and two receivers,” Ann. Probability, vol. 2, pp. 805–814, Oct. 1974.
38. R. Ahlswede and G. Dueck, “The best known codes are highly probable and can be produced by a few permutations,” submitted to IEEE Trans. Inform. Theory.
39. R. Ahlswede and T. S. Han, “On source coding with side information via a multiple-access channel and related problems,” submitted to IEEE Trans. Inform. Theory.
40. R. Ahlswede and I. Csiszar, “To get a bit of information may be as hard as to get full information,” submitted to IEEE Trans. Inform. Theory.
41. R. Ahlswede, “A method of coding and its application to arbitrarily varying channels,” to appear in J. Comb., Inform. Syst. Sci.
42. —, “An elementary proof of the strong converse theorem for the multiple-access channel,” submitted to J. Comb., Inform. Syst. Sci., 1980.
43. —, “Coloring hypergraphs: A new approach to multi-user source coding, Part I,” J. Comb., Inform. Syst. Sci., vol. 4, no. 1, pp. 76–115, 1979. Part II, to appear.
44. —, “Elimination of correlation in random codes for arbitrarily varying channel,” Z. Wahrscheinlichkeitstheorie u. Verw. Geb., vol. 44, pp. 159–175, 1978.
45. R. Ahlswede and G. Dueck, “Every bad code has a good subcode: A local converse to the coding theorem,” Z. Wahrscheinlichkeitstheorie u. Verw. Geb., vol. 34, pp. 179–182, 1976.
46. R. Ahlswede and P. Gacs, “Spreading of sets in product spaces and hypercontraction of the Markov operator,” Ann. Probability, vol. 4, no. 6, pp. 925–939, 1976.
47. R. Ahlswede, P. Gacs, and J. Körner, “Bounds on conditional probabilities with applications in multi-user communication,” Z. Wahrscheinlichkeitstheorie u, Verw. Geb., vol. 34, pp. 157–177, 1976.
48. R. Ahlswede and P. Gacs, “Two contributions to information theory,” Colloquia Mathematica Societatis Janos Bolyai, vol. 16. (Topics in Information Theory, Keszthely (Hungary), 1975.)
49. R. Ahlswede and J. Körner, “Source coding with side information and a converse for degraded broadcast channel,” IEEE Trans. Inform. Theory, vol. IT-21, pp. 629–637, Nov. 1975.
50. —, “On common information and related characteristics of correlated information sources,” presented at the 7th Prague Conf. Information Theory, Stat. Dec. Fct's, and Rand. Proc., Sept. 1974, to be published in the IEEE Trans. Inform. Theory.
51. M. Aref, “Information flow in relay networks,” Ph.D. dissertation, Stanford Univ., Stanford, CA, Oct. 1980.
52. T. Basar and T. Basar, “Optimum linear coding in continuous-time communication systems with noisy side information at the decoder,” IEEE Trans. Inform. Theory, vol. IT-25, pp. 612–616, Sept. 1979.
53. R. Benzel, “The capacity region of a class of discrete additive degraded interference channels,” IEEE Trans. Inform. Theory, vol. IT-25, pp. 228–231, Mar. 1979.
54. T. Berger, K. Housewright, J. Omura, S. Tung, and J. Wolfowitz, “An upper bound on the rate distortion function for source coding with partial side information at the decoder,” IEEE Trans. Inform. Theory, vol. 25, pp. 664–666, Nov. 1979.
55. T. Berger, “Multiterminal source coding,” The Information Theory Approach to Communications, G. Longo, Ed. (CISM Courses and Lectures, No. 229), New York: Springer Verlag, 1978, pp. 171–231.
56. T. Berger and M. Chang, “Rate-distortion with a fully informed decoder and partially informed encoder,” Abstract, 1977 IEEE Int. Symp. Information Theory (Cornell Univ., Ithaca, NY, Oct. 1977).
57. T. Berger and S. Tung, “Encoding of correlated analog sources,” in Proc. 1975 IEEE-USSR Joint Workshop on Information Theory (December 1975, Moscow, USSR), Piscataway, NJ: IEEE Press, pp. 7–10.
58. P. Bergmans, “The Gaussian interference channel,” presented at the 1976 IEEE Int. Symp. Information Theory, Ronneby, Sweden, June 1976.
59. M. Bierbaum and H. Wallmeier, “A note on the capacity region of the multiple-access channel,” IEEE Trans. Inform. Theory, vol. IT-25, p. 484, July 1979.
60. A. Carleial, “Interference channels,” IEEE Trans. Inform. Theory, vol. IT-24, pp. 60–70, Jan. 1978.
61. A. Carleial and M. Hellman, “A note on Wyner's wiretap channel,” IEEE Trans. Inform. Theory, vol. IT-23, pp. 387–390, May 1977.
62. A. Carleial, “A case where interference does not reduce capacity,” IEEE Trans. Inform. Theory, vol. IT-21, pp. 569–570, Sept. 1975.
63. S. Chang and E. Weldon, “Coding for T-user multiple-access channels,” IEEE Trans. Inform. Theory, vol. IT-25, pp. 684–691, Nov. 1979.
64. T. Cover, R. McEliece, and E. Posner, “Asynchronous multiple access channel capacity,” to be published in IEEE Trans. Inform. Theory, July 1981.
65. T. Cover and S. K. Leung, “A rate region for the multiple access channel with feedback,” to be published in IEEE Trans. Inform. Theory, Mar. 1981.
66. T. Cover, A. El Gamal, and M. Salehi, “Multiple access channels with arbitrarily correlated sources,” IEEE Trans. Inform. Theory, vol. IT-26, Nov. 1980.
67. T. Cover and A. El Gamal, “Capacity Theorems for the Relay Channel,” IEEE Trans. Inform. Theory, vol. IT-25, pp. 572–584, Sept. 1979.
68. T. Cover, “Some advances in broadcast channels,” ch. 4 in Advances in Communication Systems, Vol. 4, Theory and Applications, A. Viterbi, Ed. New York: Academic Press, 1975.
69. —, “An achievable rate region for the broadcast channel,” IEEE Trans. Inform. Theory, vol. IT-21, pp. 399–404, July 1975.
70. —, “A proof of the data compression theorem of Slepian and Wolf for ergodic sources,” IEEE Trans. Inform. Theory, vol. IT-21, no. 2, pp. 226–228, Mar. 1975. Reprinted in Ergodic and Information Theory, L. Davisson and R. Gray, Eds., (Benchmark Papers in Electrical Engineering and Computer Science). Stroudsburg, PA: Dowden, Hutchinson, and Ross, Part V, pp. 305–307.
71. I. Csiszar and J. Körner, “Towards a general theory of source networks,” IEEE Trans. Inform. Theory, vol. IT-26, pp. 155–166, Mar. 1980.
72. —, Information Theory: Coding Theorems for Discrete Memoryless Systems. New York: Academic Press, to be published in 1981.
73. —, “Graph decomposition: A new key to coding theorems,” in Preprint of Math. Inst. Hungarian Acad. Sci. (Budapest), 1979.
74. —, “Broadcast channels with confidential messages,” IEEE Trans. Inform. Theory, vol. IT-24, pp. 339–348, May 1978.
75. —, “Source networks with unauthorized users,” J. Combinatorics, Inform., and Syst. Sci., vol. 1, no. 1, pp. 25–40, 1976.
76. M. Deaett and J. Wolf, “Some very simple codes for the nonsynchronized two-user multiple access adder channel with binary inputs,” IEEE Trans. Inform. Theory, vol. IT-24, pp. 635–636, Sept. 1978.
77. C. Downey and J. Karlof, “Group codes for the Gaussian broadcast channel with two receivers,” IEEE Trans. Inform. Theory, vol. IT-26, pp. 406–412, July 1980.
78. G. Dueck, “Semi-feedback for multiple-user channels,” Preprint. Submitted for publication.
79. —, “The strong converse of the coding theorem for the multiple access channel,” to be published in J. Comb., Inform. Syst. Sci.
80. —, “Partial feedback for two-way and broadcast channels,” to be published in Inform. Contr.
81. —, “A note on the multiple access channel with correlated sources,” to be published in IEEE Trans. Inform. Theory, vol. IT-27, Mar. 1981.
82. —, “The capacity region of the two-way channel can exceed the inner bound,” Inform. Contr., vol. 40, pp. 258–266, 1979.
83. —, “Maximal error capacity regions are smaller than average error capacity regions for multi-user channels,” Prob. Cont. Inform. Theory, vol. 7, pp. 11–19, 1978.
84. A. El Gamal and T. Cover, “Information theory of joint descriptions,” submitted to IEEE Trans. Inform. Theory.
85. A. El Gamal, “The capacity of the deterministic relay channel,” to be published in IEEE Trans. Inform. Theory.
86. —, “The capacity of the physically degraded Gaussian broadcast channel with feedback,” to be published in IEEE Trans. Inform. Theory.
87. A. El Gamal and E. van der Meulen, “A proof of Marton's coding theorem for the discrete memoryless broadcast channel,” to be published in IEEE Trans. Inform. Theory, vol. IT-27, Jan. 1981.
88. A. El Gamal, “The capacity of the product and sum of two inconsistently degraded broadcast channels,” Probl. Peredachi Inform., vol. 1, 1980.
89. —, “The capacity of a class of broadcast channels,” IEEE Trans. Inform. Theory, vol. IT-25, pp. 166–169, Mar. 1979.
90. —, “The feedback capacity of degraded broadcast channels,” IEEE Trans. Inform. Theory, vol. IT-24, pp. 379–381, May 1978.
91. A. El Gamal and C. Heegard, “On the capacity of a computer memory with defects and noise,” submitted for publication in IEEE Trans. Inform. Theory.
92. N. Gaarder and J. Wolf, “The capacity region of a multiple-access discrete memoryless channel can increase with feedback,” IEEE Trans. Inform. Theory, vol. IT-21, pp. 100–102, Jan. 1975.
93. S. Gelfand and M. Pinsker, “Coding for channel with random parameters,” Probl. Contr. Inform. Theory, vol. 9, no. 1, pp. 19–31, 1980.
94. —, “Capacity of a broadcast channel with one deterministic component,” Probl. Inform. Transmission, vol. 16, no. 1, 1980.
95. S. Gelfand, “Capacity of one broadcast channel,” Probl. Inform. Transmission, vol. 13, no. 3, pp. 240–242 (English transl.), 1977.
96. R. Gray and P. Shields, “The maximum mutual information between two random processes,” Inform. Contr., vol. 33, no. 4, pp. 273–280, Apr. 1977.
97. B. Hajek and M. Pursley, “Evaluation of an achievable rate region for the broadcast channel,” IEEE Trans. Inform. Theory, vol. IT-25, pp. 36–46, Jan. 1979.
98. T. S. Han, “Slepian-Wolf-Cover theorem for networks of channels,” Res. Memo. RMI 79-1, Univ. Tokyo. (Submitted for publication to Inform. Contr.)
99. T. S. Han and K. Kobayashi, “A new achievable rate region for the interference channel and its evaluation,” Res. Memo. RMI 79-9, Univ. Tokyo. (To be published in IEEE Trans. Inform. Theory, vol. IT-27, Jan. 1981.)
100. T. S. Han, “Deterministic broadcast channels with a common message,” IEEE Trans. Inform. Theory, vol. IT-26, Nov. 1980.
101. T. S. Han and R. Ahlswede, “On source coding with side information via a multiple-access channel and related problems,” submitted to IEEE Trans. Inform. Theory.
102. T. S. Han and K. Kobayashi, “An achievable rate region for noiseless source coding in a general multiterminal situation,” IEEE Trans. Inform. Theory, vol. IT-26, May 1980.
103. T. S. Han, “Source coding with cross observations at the encoders,” IEEE Trans. Inform. Theory, vol. IT-25, pp. 360–361, May 1979.
104. —, “The capacity region of general multiple-access channel with certain correlated sources,” Inform. Contr., vol. 40, no. 1, pp. 37–60, Jan. 1979.
105. C. Heegard, H. DePedro, and J. Wolf, “Permutation codes for the Gaussian broadcast channel with two receivers,” IEEE Trans. Inform. Theory, vol. IT-24, no. 5, pp. 569–578, Sept. 1978.
106. G. D. Hu and S. Y. Shen, “Some new results of Shannon theory,” Nankai University, Tianjin, China, Mar. 1980.
107. D. Hughes-Hartogs, “The capacity of the degraded spectral Gaussian broadcast channel,” Tech. Rep. 7002-2, Information Systems Lab., Stanford Univ., Stanford, CA. Also Ph.D. dissertation, July 1975.
108. K. Jahn, “Coding of arbitrarily varying multiuser channels,” Stanford Univ., Stanford, CA, Tech. Rep., 1979.
109. —, “Coding with side information and a rate-distortion theorem for arbitrarily varying correlated sources,” Stanford Univ., Stanford, CA, Tech. Rep., 1979.
110. K. Jarett and T. Cover, “Asymmetries in relativistic information flow,” to be published in IEEE Trans. Inform. Theory, vol. IT-27, 1981.
111. R. Kahn and M. Hellman, “On the wiretap channel with feedback,” to be published in IEEE Trans. Inform. Theory.
112. T. Kasami and S. Lin, “Decoding of linear δ-decodable codes for a multiple access channel,” IEEE Trans. Inform. Theory, vol. IT-24, pp. 633–635, Sept. 1978.
113. —, “Bounds on the achievable rates of block coding for a memoryless multiple access channel,” IEEE Trans. Inform. Theory, vol. IT-24, pp. 187–197, Mar. 1978.
114. —, “Coding for a multiple access channel,” IEEE Trans. Inform. Theory, vol. IT-22, pp. 129–137, Mar. 1976.
115. A. Kaspi and T. Berger, “Rate-distortion for correlated sources with partially separated encoders,” submitted to IEEE Trans. Inform. Theory.
116. C. Keilers, “The capacity of the spectral Gaussian multiple-access channel,” Ph.D. dissertation Dep. Elec. Eng., Stanford Univ., Stanford, CA, Apr. 1976.
117. J. Kieffer, M. Pursley, M. Wallace, and J. Wolfowitz, “Coding for correlated sources with unknown parameters,” in Proc. 1980 Conf. Information Sciences and Systems (Princeton, NJ). pp. 168–171, Mar. 1980.
118. R. King, “Multiple access channels with generalized feedback,” Ph.D. dissertation, Stanford Univ., Stanford, CA, ISL Rep. 6152-1, Mar. 1978.
119. J. Körner, “Source networks and new information quantities,” in Coll. Int. CNRS, no. 276 (Theorie de l'Information), pp. 235–242, Paris, France, 1977.
120. —, “Some methods in multi-user communication,” in Information Theory, New Trends and Open Problems, G. Longo, Ed. Vienna, Austria: Springer Verlag, 1976, pp. 172–176.
121. J. Körner and K. Marton, “How to encode the mod 2 sum of two binary sources,” IEEE Trans. Inform. Theory, vol. IT-25, pp. 219–221, Mar. 1979.
122. —, “Images of a set via two channels and their role in multi-user communication,” IEEE Trans. Inform. Theory, vol. IT-23, pp. 751–761, Nov. 1977.
123. —, “Comparison of two noisy channels,” Coll. Math. Soc. F. Boliya, vol. 16, in Topics in Information Theory, Amsterdam, The Netherlands: North Holland, 1977, pp. 411–423.
124. —, “General broadcast channels with degraded message sets,” IEEE Trans. Inform. Theory, vol. IT-23, pp. 60–64, Jan. 1977.
125. J. Körner and A. Sgarro, “Universally attainable error exponents for broadcast channels with degraded message sets,” IEEE Trans. Inform. Theory, vol. IT-25, Nov. 1980.
126. V. Koshelev, “On a problem of separate coding for two dependent sources,” Probl. Trans. Inform., vol. 13, pp. 26–32, Jan.–Mar. 1977.
127. S. K. L.-Y. Cheong and M. Hellman, “The Gaussian wire-tap channel,” IEEE Trans. Inform. Theory, vol. IT-24, pp. 451–456, July 1978.
128. S. Lu, “On secrecy systems with side information about the message available to a cryptanalyst,” IEEE Trans. Inform. Theory, vol. IT-25, pp. 472–475, July 1979.
129. K. Mackenthun, “An evaluation of the Wyner-Ziv rate region,” IEEE Trans. Inform. Theory, vol. IT-26, pp. 347–354, May 1980.
130. K. Marton, “A coding theorem for the discrete memoryless broadcast channel,” IEEE Trans. Inform. Theory, vol. IT-25, pp. 306–311, May 1979.
131. —, “The capacity region of deterministic broadcast channels,” in Trans. Int. Symp. Inform. Theory (Paris-Cachan, France) 1977.
132. L. Ozarow, “Coding and capacity for additive white Gaussian noise multi-user channels with feedback,” Ph.D. dissertation, Dep. Elec. Eng. and Comput. Sci., M.I.T., Cambridge, MA.
133. R. Peterson and D. Costello, “Comments on ‘Convolutional tree codes for multiple access channels,’” IEEE Trans. Inform. Theory, vol. IT-26, pp. 627–628, Sept. 1980.
134. M. Pinsker, “The capacity region of noiseless broadcast channels,” Probl. Inform. Transmission, vol. IT-14, pp. 97–102, 1978 (English transl.).
135. G. Sh. Poltyrev, “Capacity of parallel broadcast channels with degraded subchannels,” Probl. Trans. Inform., vol. 13, no. 2, pp. 23–36, Apr.–June 1977 (English transl.).
136. —, “Capacity for a sum of broadcast channels,” Probl. Inform. Trans, vol. 15, no. 2, pp. 111–114, Apr.–June 1979 (English transl.).
137. H. Sato, “A study on Gaussian two-user channel,” submitted to IEEE Trans. Inform. Theory.
138. —, “The capacity region of two-user channels—Method of extension channels,” in Abstract Proc. 1979 IEEE Int. Symp. Inform. Theory, July 1979.
139. H. Sato and M. Tanabe, “A discrete two-user channel with strong interference,” Trans. IECE Japan, vol. E61, no. 11, p. 880, Nov. 1978.
140. H. Sato, “On degraded Gaussian two-user channels,” IEEE Trans. Inform. Theory, vol. IT-24, p. 637, Sept. 1978.
141. —, “An outer bound to the capacity region of broadcast channels,” IEEE Trans. Inform. Theory, vol. IT-24, no. 3, p. 374, May 1978.
142. —, “On the capacity region of a discrete two-user channel for strong interference,” IEEE Trans. Inform. Theory, vol. IT-24, p. 377, May 1978.
143. —, “Two-user communication channels,” IEEE Trans. Inform. Theory, vol. IT-23, p. 295, May 1977.
144. —, “Information transmission through a channel with relay,” Tech. Report ALOHA SYSTEM B-76-7, Mar. 1976.
145. M. Ulrey, “The capacity region of a channel with s senders and r receivers,” Inform. Contr., vol. 29, no. 3, pp. 185–203, Nov. 1975.
146. E. C. van der Meulen, “A survey of multi-way channels in information theory: 1961–1976,” IEEE Trans. Inform. Theory, vol. IT-23, pp. 1–37, Jan. 1977.
147. —, “Random coding theorems for the general discrete memoryless broadcast channel,” IEEE Trans. Inform. Theory, vol. IT-21, pp. 180–190, Mar. 1975.
148. E. Verriest and M. Hellman, “Convolutional encoding for Wyner's wiretap channel,” IEEE Trans. Inform. Theory, vol. IT-25, pp. 234–236, Mar. 1979.
149. J. Willems, “The feedback capacity region of a class of discrete memoryless multiple access channels,” Preprint, Univ. Leuven, Belgium, 1980.
150. H. Witsenhausen, “Indirect rate distortion problems,” TEFE Trans. Inform. Theory, vol. IT-26, Sept. 1980.
151. —, “On source networks with minimal breakdown degradation,” Bell Syst. Tech. J., vol. 59, pp. 1083–1087, July–Aug. 1980.
152. —, “Some aspects of convexity useful in information theory,” IEEE Trans. Inform. Theory, vol. IT-26, pp. 265–271, May 1980.
153. —, “The zero-error side-information problem and chromatic numbers,” IEEE Trans. Inform. Theory, vol. IT-22, pp. 592–593, Sept. 1976.
154. —, “Values and bounds for the common information of two discrete random variables,” SIAM J. Appl. Math., vol. 31, pp. 313–333, Sept. 1976.
155. H. Witsenhausen and A. Wyner, “A conditional entropy bound for a pair of discrete random variables,” IEEE Trans. Inform. Theory, vol. IT-21, pp. 493–501, Sept. 1975.
156. H. Witsenhausen, “On sequences of pairs of dependent random variables,” SIAM J. Appl. Math., vol. 28, pp. 100–113, Jan. 1975.
157. J. Wolf, A Wyner, and J. Ziv, “Source coding for multiple descriptions,” Bell Syst. Tech. J., vol. 59, Oct. 1980.
158. J. Wolf, “Multi-user communication networks,” in Commun. Syst. and Random Process Theory, J. K. Skwirzynski, Ed. Alphen aaan den Rijn-The Netherlands: Sijthoff & Noordhoff, 1978, pp. 37–53.
159. —, “The AEP property of random sequences and applications to information theory: Part I basic principles,” Inform. Theory, New Trends and Open Problems, G. Longo, Ed., (CISM Courses and Lectures No. 219). New York: Springer-Verlag, 1975.
160. J. Wolfowitz, Coding Theorems of Information Theory, 3rd ed. New York: Springer-Verlag, 1978.
161. A. Wyner, “The rate-distortion function for source coding with side-information at the Decoder II: General sources,” Inform. Contr., vol. 38, pp. 60–80, July 1980.
162. A. Wyner and J. Ziv, “The rate-distortion function for source coding with side-information at the decoder,” IEEE Trans. Inform. Theory, vol. IT-22, pp. 1–10, Jan. 1976.
163. A. Wyner, “The wire-tap channel,” Bell Syst. Tech. J., vol. 54, pp. 1355–1387, Oct. 1975.
164. —, “On source coding with side information at the decoder,” IEEE Trans. Inform. Theory, vol. IT-21, pp. 294–300, May 1975.
165. —, “The common information of two dependent random variables,” IEEE Trans. Inform. Theory, vol. IT-21, pp. 163–170, Mar. 1975.