Comments on broadcast channels

IEEE Transactions on Information Theory

Volumn 44, Issue 6, 1998, Pages 2524-2530

  Cover, Thomas M ^a,b  

^a IEEE   (United States)

^b STANFORD UNIVERSITY   (United States)

Author keywords

Binning; Broadcast channel; Capacity; Degraded broadcast channel; Feedback capacity; Slepian wolf; Superposition

Indexed keywords

CHANNEL CAPACITY; PROBABILITY; SIGNAL RECEIVERS; THEOREM PROVING;

BINNING; BROADCAST CHANNELS; FEEDBACK CAPACITY; SUPERPOSITION;

COMMUNICATION CHANNELS (INFORMATION THEORY);

EID: 0032184236     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.720547     Document Type: Article

References (129)

1. R. Ahlswede, Multi-way communication channels, in P roc. 2nd Int. Symp. Inform Theory (Tsahkadsor, Armenian S.S.R., 1971). Budapest, Hungary: Hungarian Acad. Sciences, 1973, pp. 23-52.
2. The capacity region of a channel with two senders and two receivers, Ann. Probab., vol. 2, pp. 805-814, Oct. 1974.
3. R. F. Ahlswede and J. Körner, Source coding with side information and a converse for degraded broadcast channels, IEEE Trans. Inform. Theory, vol. IT-21, pp. 629-637, Nov. 1975.
4. M. Aref, Information flow in relay networks, Ph.D. dissertation, Stanford Univ., Stanford, CA, Oct. 1980.
5. L. A. Bassalygo, Bound for permissible transmission rates in a broadcast channel with errors in both components, Probl. Pered. Inform., vol. 17, no. 4, pp. 19-28, Oct.-Dec. 1981;
6. translated in Probl. Inform. Transm., vol. 17, no. 4, pp. 228-236, Oct.-Dec. 1981.
7. L. A. Bassalygo and M. S. Pinsker, Bounds on volume of errorcorrecting codes in a broadcast channel (generalized Blackwell channel), Probl. Pered. Inform., vol. 16, no. 3, pp. 3-16, July-Sept. 1980;
8. translated in Probl. Inform. Transm., vol. 16, no. 3, pp. 163-174, July-Sept. 1980.
9. -, A comment on the paper of Kasami, Lin, Wei, and Yamamura, 'Coding for the binary symmetric broadcast channel with two receivers,' Probl. Pered. Inform., vol. 24, no. 3, pp. 102-106, July-Sept. 1988;
10. translated in Probl. Inform. Transm., vol. 24, no. 3, pp. 253-257, July-Sept. 1988.
11. 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.
12. P. P. Bergmans, Random coding theorem for broadcast channels with degraded components, IEEE Trans. Inform. Theory, vol. IT-19, pp. 197-207, Mar. 1973.
13. A simple converse for broadcast channels with additive white Gaussian noise, IEEE Trans. Inform. Theory, vol. IT-20, pp. 279-280, Mar. 1974.
14. P. P. Bergmans and T. M. Cover, Cooperative broadcasting, IEEE Trans. Inform. Theory, vol. IT-20, pp. 317-324, May 1974.
15. R. E. Blahut, Principles and Practice of Information Theory. Reading, MA: Addison-Wesley, 1987.
16. L. Boutsikaris and R. Narayan, An achievable rate region for a broadcast channel and its implications on signal design in IEEE Int. Symp. Information Theory (St. Jovite, Que., Canada, Sept. 1983), p. 62.
17. A. Carleial, A case where interference does not reduce capacity, IEEE Trans. Inform. Theory, vol. IT-23, pp. 387-390, May 1977.
18. S. C. Chang, Coding for T-user binary symmetric broadcast channels, in IEEE Int. Symp. Information Theory (Santa Monica, CA, Feb. 1981), p. 34.
19. T. M. Cover, Broadcast channels, IEEE Trans. Inform. Theory, vol. IT-18, pp. 2-14, Jan. 1972.
20. 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.
21. An achievable rate region for the broadcast channel, IEEE Trans. Inform. Theory, vol. IT-21, pp. 399-404, July 1975.
22. Some advances in broadcast channels, in Advances in Communication Systems, Vol. 4, Theory and Applications, A. Viterbi, Ed. New York: Academic, 1975, ch. 4.
23. T. M. Cover and A. El Gamal, Capacity theorems for the relay channel, IEEE Trans. Inform. Theory, vol. IT-25, Sept. 1979.
24. T. M. Cover and S. K. Leung, An achievable rate region for the multiple-access channel with feedback, IEEE Trans. Inform. Theory, vol. IT-27, pp. 292-298, Mar. 1981.
25. T. M. Cover and J. A. Thomas, Elements of Information Theory. Wiley, 1991.
26. I. Csiszâr and J. Körner, Information Theory: Coding Theorems for Discrete Memoryless Systems. New York: Academic, 1981.
27. Broadcast channels with confidential messages, IEEE Trans. Inform. Theory, vol. IT-24, pp. 339-348, May 1978.
28. H. De Pedro, C. Heegard, and J. K. Wolf, Permutation codes for the Gaussian broadcast channel, in IEEE Int. Symp. Information Theory (Ronneby, Sweden, June 1976), pp. 64-65.
29. R. L. Dobrushin, Survey of Soviet research in information theory, IEEE Trans. Inform. Theory, vol. IT-18, pp. 703-724, Nov. 1972.
30. C. P. Downey and J. K. Karlof, Group codes for the Gaussian broadcast channel with two receivers, IEEE Trans. Inform. Theory, vol. IT-26, pp. 406-411, July 1980.
31. -, Group codes for the M-receiver Gaussian broadcast channel, IEEE Trans. Inform. Theory, vol. IT-29, pp. 595-597, July 1983;
32. also, in IEEE Int. Symp. Information Theory (Santa Monica, CA, Feb. 1981), pp. 34-35.
33. G. Dueck, Partial feedback for two-way and broadcast channels, Inform. Contr., vol. 46, no. 1, pp. 1-15, July 1980.
34. A. El Gamal, The feedback capacity of degraded broadcast channels, IEEE Trans. Inform. Theory, vol. IT-24, pp. 379-381, May 1978.
35. -, Broadcast channels with and without feedback, in llth Annu. Asilomar Conf. Circuits, Systems and Computers (Pacific Grove, CA, Nov. 1977), pp. 180-183.
36. The capacity of a class of broadcast channels, IEEE Trans. Inform. Theory, vol. IT-25, pp. 166-169, Mar. 1979.
37. -, Capacity of the product and sum of two unmatched broadcast channels, Probl. Pered. Inform., vol. 16, no. 1, pp. 3-23, Jan.-Mar. 1980;
38. translated in Probl. Inform. Transm., vol. 16, no. 1, pp. 1-16, Jan.-Mar. 1980.
39. The capacity of the physically degraded Gaussian broadcast channel with feedback, IEEE Trans. Inform. Theory, vol. IT-27, p. 508, July 1981.
40. A. El Gamal and T. M. Cover, Multiple user information theory, Proc. IEEE, vol. 68, pp. 1466-1483, Dec. 1980.
41. A. El Gamal and E. Van der Meulen, A proof of Marion's coding theorem for the discrete memoryless broadcast channel, IEEE Trans. Inform. Theory, vol. IT-27, pp. 120-122, Jan. 1981.
42. P. Estabrook and B. Jacobs, Optimization of direct broadcast satellite system channel capacity, in Int. Conf. Communications: Integrating Communication for World Progress (ICC'83) (Boston, MA, June 1983), vol. 3, pp. 1416-1420.
43. G. D. Forney, Information theory, unpublished course notes, 1972.
44. P. Gacs and J. Korner, Common information is much less than mutual information, Probl. Contr. Inform. Theory, vol. 2, no. 2, pp. 149-162, 1973.
45. R. G. Gallager, Information Theory and Reliable Communication. New York: Wiley, 1968.
46. -, Capacity and coding for degraded broadcast channels, Probl. Pered. Inform., vol. 10, no. 3, pp. 3-14, July-Sept. 1974;
47. translated in Probl. Inform. Transm., pp. 185-193, July-Sept. 1974.
48. S. I. Gelfand, Capacity of one broadcast channel, Probl. Pered. Inform., vol. 13, no. 3, pp. 106-108, July-Sept. 1977;
49. translated in Probl. Inform. Transm., pp. 240-242, July-Sept. 1977.
50. S. I. Gelfand and M. S. Pinsker, Capacity of a broadcast channel with one deterministic component, Probl. Pered. Inform., vol. 16, no. 1, pp. 24-34, Jan.-Mar. 1980;
51. translated in Probl. Inform. Transm., vol. 16, no. 1, pp. 17-25, Jan.-Mar. 1980 .
52. Coding for channel with random parameters, Probl. Contr. Inform. Theory, vol. 9, no. 1, pp. 19-31, 1980.
53. L. Georgiadis and P. Papantoni-Kazakos, Limited feedback sensing algorithms for the broadcast channel, in IEEE Int. Conf. Communications (Chicago, IL, June 1985), vol. 1, pp. 52-55.
54. -, Limited feedback sensing algorithms for the packet broadcast channel, IEEE Trans. Inform. Theory, vol. IT-31, pp. 280-294, Mar. 1985.
55. A. Goldsmith, Capacity and dynamic resource allocation in broadcast fading channels, in Proc. 33rd Annu. Allerton Conf. Communication, Control, and Computing, (Monticello, IL, Oct. 1995), pp. 915-924.
56. -, Capacity of broadcast fading channels with variable rate and power, in IEEE GLOBECOM 1996, Communications: The Key to Global Prosperity (London, UK, Nov. 1996), pp. 92-96.
57. A. Goldsmith and M. Effros, The capacity region of broadcast channels with memory, in Proc. IEEE Int. Symp. Inform. Theory (Ulm, Germany, June-July 1997), p. 28.
58. I. Gopal and R. Rom, Multicasting to multiple groups over broadcast channels, IEEE Trans. Commun., vol. 42, pp. 2423-2431, July 1994.
59. B. E. Hajek and M. B. Pursley, Evaluation of an achievable rate region for the broadcast channel, IEEE Trans. Inform. Theory, vol. IT-25, pp. 36-46, Jan. 1979;
60. also in Proc. Int. Conf. Communications (Chicago, IL, June 1977), pp. 249-253.
61. T. S. Han, The capacity region for the deterministic broadcast channel with a common message, IEEE Trans. Inform. Theory, vol. IT-27, pp. 122-125, Jan. 1981.
62. -, A new achievable rate region for the interference channel, IEEE Trans. Inform. Theory, vol. IT-27, pp. 49-60, Jan. 1981.
63. T. S. Han and M. H. M. Costa, Broadcast channels with arbitrarily cor-related sources, IEEE Trans. Inform. Theory, vol. IT-33, pp. 641-650, Sept. 1987.
64. C. Heegard, H. E. DePedro, and J. K. Wolf, Permutation codes for the Gaussian broadcast channel with two receivers, IEEE Trans. Inform. Theory, vol. IT-24, pp. 569-578, Sept. 1978.
65. C. Heegard and A. El Gamal, On the capacity of computer memory with defects, IEEE Trans. Inform. Theory, vol. IT-29, pp. 731-739, Sept. 1983.
66. D. Hughes-Hartogs, The capacity of the degraded spectral Gaussian broadcast channel, Ph.D. dissertation, Inform. Syst. Lab., Stanford Univ. Stanford, CA, Tech. Rep. 7002-2, July 1975;
67. also in Proc. Nat. Telecommun. Conf. (Dallas, TX, Dec. 1976), p. 52.1/1-5.
68. J. H. Jahn, Coding of arbitrarily varying multiuser channels, IEEE Trans. Inform. Theory, vol. IT-27, pp. 212-226, Mar. 1981.
69. T. Kasami, S. Lin, V. K. Wei, and S. Yamamura, Coding for the binary symmetric broadcast channel with two receivers, IEEE Trans. Inform. Theory, vol. IT-31, pp. 616-625, Sept. 1985;
70. also in Proc. IEEE Int. Symp. Information Theory (St. Jovite, Que., Canada, Sept. 1983), p. 61.
71. C. Keilers, The capacity of the spectral Gaussian multiple-access channel, Ph.D. dissertation, Dept. Elec. Eng., Stanford Univ., Stanford, CA, Apr. 1976.
72. R. King, Multiple access channels with generalized feedback, Ph.D. dissertation, Stanford Univ., Stanford, CA, Mar. 1978.
73. J. Körner, 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.
74. J. Körner and K. Marton, General broadcast channels with degraded message sets, IEEE Trans. Inform. Theory, vol. IT-23, pp. 60-64, Jan. 1977.
75. -, Comparison of two noisy channels, Coll. Math. Sco. F. Boliya, vol. 16, in Topics of Information Theory. Amsterdam, The Netherlands: North Holland, 1977, pp. 411-423.
76. J. Körner and A. Sgarro, Universally attainable error exponents for broadcast channels with degraded message sets, IEEE Trans. Inform. Theory, vol. IT-26, pp. 670-679, Nov. 1980.
77. B. D. Kudryashov, Upper bounds for decoding error probability in some broadcast channels, Probl. Pered. Inform., vol. 15, no. 3, pp. 3-17, July-Sept. 1979;
78. translated in Probl. Inform. Transm., pp. 163-174, July-Sept. 1979.
79. B. D. Kudryashov and G. S. Poltyrev, Upper bounds for decoding error probability in some broadcast channels, Probl. Pered. Inform., vol. 15, no. 3, pp. 3-17, July-Sept. 1979;
80. translated in Probl. Inform. Transm., vol. 15, no. 3, pp. 163-174, July-Sept. 1979.
81. A. V. Kuznetsov, Use of defect-correcting codes to restrict access to a broadcast channel, Probl. Pered. Inform., vol. 17, no. 4, pp. 3-10, Oct.-Dec. 1981;
82. translated in Probl. Inform. Transm., pp. 217-222, Oct.-Dec. 1981.
83. W. J. Leighton and H. H. Tan, Broadcast channels: Some recent developments and open problems, in Proc. Int. Telemetering Conf. (Los Angeles, CA, Sept. 1976), pp. 284-293.
84. Trellis coding for degraded broadcast channels, Inform. Contr., vol. 39, no. 2, pp. 119-134, Nov. 1978;
85. and in Proc. IEEE Int. Symp. Inform. Theory (Ithaca, NY, Oct. 1977), p. 54.
86. Capacity region of degraded broadcast channels with feedback, Inform.ation Sci., vol. 13, no. 2, pp. 167-177, 1977.
87. C. Leung, On the capacity of an n-receiver broadcast channel with partial feedback, in IEEE Int. Symp. Inform. Theory (Santa Monica, CA, Feb. 1981), p. 27.
88. H. Liao, A coding theorem for multiple access communication, in Int. Symp. Information Theory (Asilomar, 1972); also
89. Multiple access channels, Ph.D. dissertation, Dept. Elec. Eng., Univ. Hawaii, Honolulu, HI, 1972.
90. K. Marton, The capacity region of deterministic broadcast channels, in Trans. Int. Symp. Inform. Theory (Paris-Cachan, France, 1977).
91. A coding theorem for the discrete memoryless broadcast channel, IEEE Trans. Inform. Theory, vol. IT-25, pp. 306-311, May 1979.
92. R. J. McEliece and L. Swanson, A note on the wide-band Gaussian broadcast channel, IEEE Trans. Commun., vol. COM-35, pp. 452-4153, Apr. 1987.
93. F. Morii, H. Nakanishi, and Y. Tezuka, Error probabilities for Gaussian broadcast channel, Electron, and Commun. Japan, vol. 59, no. 6, pp. 18-26, June 1976.
94. M. Ohkubo, A coding theorem for broadcast channels with degraded components, Trans. Inst. Electron. Commun. Eng. Japan, Section E (English), vol. E61, no. 12, p. 979, Dec. 1978.
95. J. M. Ooi and G. W. Wornell, Decentralized control of a multiple access broadcast channel: Performance bounds, in Proc. 35th IEEE Conf. Decision and Control (Kobe, Japan, Dec. 1996), vol. 1, pp. 293-298.
96. L. Ozarow, Coding and capacity for additive white Gaussian noise multi-user channels with feedback, Ph.D. dissertation, Dept. Elec. Eng. and Comp. Sci., MIT, Cambridge, MA, 1983.
97. L. H. Ozarow and S. K. Leung-Yan-Cheong, An achievable region and outer bound for the Gaussian broadcast channel with feedback, IEEE Trans. Inform. Theory, vol. IT-30, pp. 667-671, July 1984.
98. M. S. Pinsker, Capacity of noiseless broadcast channels, Probl. Pered. Inform., vol. 14, no. 2, pp. 28-34, Apr.-June 1978;
99. translated in Probl. Inform. Transm., pp. 97-102, Apr.-June 1978.
100. N. Pippenger, Bounds on the performance of protocols for a multipleaccess broadcast channel, IEEE Trans. Inform.Theory, vol. IT-27, pp. 145-151, Mar. 1981.
101. G. S. Poltyrev, Carrying capacity for parallel broadcast channels with degraded components, Probl. Pered. Inform., vol. 13, no. 2, pp. 23-35, Apr.-June 1977;
102. translated in Probl. Inform. Transm., pp. 97-107, Apr.-June 1977.
103. Capacity for a sum of broadcast channels, Probl. Inform Transm., vol. 15, no. 2, pp. 111-114, Apr.-June 1979 (English translation).
104. On accuracy of random coding bounds for broadcast channels, Probl. Contr. Inform. Theory, vol. 11, no. 5, pp. 1-11, 1982 (English translation of a Russian paper).
105. -, Random-coding bounds for some broadcast channels, Probl. Pered. Inform., vol. 19, no. 1, pp. 9-20, Jan.-Mar. 1983;
106. translated in Probl. Inform. Transm., vol. 19, no. 1, pp. 6-16, Jan.-Mar. 1983.
107. H. Sari, G. Karam, and I. Jeanclaud, Frequency-domain equalization of mobile radio and terrestrial broadcast channels, in Proc. IEEE GLOBECOM (San Francisco, CA, Nov.-Dec. 1994), vol. 1, pp. 1-5.
108. H. Sato, An outer bound to the capacity region of broadcast channels, IEEE Trans. Inform. Theory, vol. IT-24, p. 374, May 1978.
109. S. Shamai, A broadcast strategy for the Gaussian slowly fading channel, in Proc. IEEE Int. Symp. Information Theory (Ulm, Germany, June-July 1997), p. 150.
110. C. E. Shannon, The zero-error capacity of a noisy channel, IRE Trans. Inform. Theory, vol. IT-2, pp. 8-19, 1956.
111. Two-way communication channels, in Proc. 4th Berkeley Symp. Prob. Stat. Berkeley, CA: Univ. California Press, 1961, vol. 1, pp. 611-644.
112. B. D. Sharma and V. Priya, On broadcast channels with side information under fidelity criteria, Kybernetika, vol. 19, no. 1, pp. 27-411, 1983.
113. D. Slepian and J. K. Wolf, Noiseless coding of corelated information sources, IEEE Trans. Inform. Theory, vol. IT-19, pp. 471-4180, July 1973.
114. B. S. Tsybakov and V. A. Mikhailov, Free synchronous packet access in a broadcast channel with feedback, Probl. Pered. Inform., vol. 14, no. 4, pp. 32-59, Oct.-Dec. 1978;
115. translated in Probl. Inform. Transm., pp. 259-280, Oct.-Dec. 1978.
116. D. N. Tse, Optimal power allocation over parallel Gaussian broadcast channels, in Proc. IEEE Int. Symp. Information Theory (Ulm, Germany, June-July 1997), p. 27.
117. E. C. Van der Meulen, Random coding theorems for the general discrete memoryless broadcast channel, IEEE Trans. Inform. Theory, vol. IT-21, pp. 180-190, Mar. 1975.
118. A survey of multi-way channels in information theory: 1961-1976, IEEE Trans. Inform. Theory, vol. IT-23, pp. 1-37, Jan. 1977.
119. Recent coding theorems for multi-way channels. Part I: The broadcast channel (1976-1980), in New Concepts in Multi-User Communication (NATO Advanced Study Institute Series), J. K. Skwyrzinsky, Ed. Groningen, The Netherlands: Sijthoff & Noordhof, 1981.
120. -, Recent coding theorems and converses for multi-way channels. Part II: The multiple access channel (1976-1985), Department Wiskunde, Katholieke Universiteit Leuven, Leuven, Belgium, 1985.
121. M. Van Dijk, The binary symmetric broadcast channel with confidential messages, with tampering, in Proc. 1995 IEEE Int. Symp. Information Theory (Whistler, BC, Canada, Sept. 1995), p. 487.
122. On a special class of broadcast channels with confidential messages, IEEE Trans. Inform. Theory, vol. 43, pp. 712-714, Mar. 1997.
123. P. Vanroose and E. C. Van der Meulen, A new proof of the zeroerror capacity region of the Blackwell broadcast channel, in Proc. 10th Symp. Information Theory in the Benelux (Houthalen, Belgium, May 1989), pp. 37-43.
124. B. Verboven and E. Van der Meulen, Capacity bounds for identification via broadcast channels that are optimal for the deterministic broadcast channel, IEEE Trans. Inform. Theory, vol. 36, pp. 1197-1205, Nov. 1990.
125. N. D. Vvedenskaya and B. S. Tsybakov, Stack algorithm in a broadcast channel with capture, Probl. Pered. Inform., vol. 27, no. 2, pp. 25-34, Apr.-June 1991;
126. translated in Probl. Inform. Transm., pp. 107-116, Apr.-June 1991.
127. F. M. J. Willems, The maximal-error and average-error capacity region of the broadcast channel are identical, Probl. Contr. Inform. Theory-Probl. Upravl. I Teorii Inform., vol. 19, no. 4, pp. 339-347, 1990.
128. J. Wolf, Multi-user communication networks, in Commun. Syst. and Random Process Theory, J. K. Skwirzynski, Ed. Alphen aan den Rijn, The Netherlands: Sijthoff & Norrdhoff, 1978, pp. 37-53.
129. A. Wyner, Recent results in the Shannon theory, IEEE Trans. Inform. Theory, vol. IT-20, pp. 2-10, Jan. 1974.