메뉴 건너뛰기




Volumn 56, Issue 4, 2010, Pages 1828-1851

The capacity region of the degraded finite-state broadcast channel

Author keywords

Broadcast channels; Capacity; Channels with memory; Finite state channels; Indecomposable channels; Network information theory; Superposition codebook

Indexed keywords

BROADCAST CHANNELS; CHANNELS WITH MEMORY; CODEBOOKS; FINITE-STATE; NETWORK INFORMATION THEORY;

EID: 77950228257     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2010.2040974     Document Type: Article
Times cited : (12)

References (36)
  • 1
    • 0015287303 scopus 로고
    • Broadcast channels
    • Jan.
    • T. M. Cover, "Broadcast channels," IEEE Trans. Inf. Theory, vol.IT-18, pp. 2-14, Jan. 1972.
    • (1972) IEEE Trans. Inf. Theory , vol.IT-18 , pp. 2-14
    • Cover, T.M.1
  • 2
    • 0001413858 scopus 로고
    • The basic theorems of information theory
    • B. McMillan, "The basic theorems of information theory," Ann. Math. Statist., vol.24, no.2, pp. 196-219, 1953.
    • (1953) Ann. Math. Statist. , vol.24 , Issue.2 , pp. 196-219
    • McMillan, B.1
  • 3
    • 0003180975 scopus 로고
    • Certain results in coding theory for noisy channels
    • Sep.
    • C. E. Shannon, "Certain results in coding theory for noisy channels," Inf. Control, vol.1, pp. 6-25, Sep. 1957.
    • (1957) Inf. Control , vol.1 , pp. 6-25
    • Shannon, C.E.1
  • 4
    • 0000066683 scopus 로고
    • Proof of Shannon's transmission theorem for finite-state indecomposable channels
    • D. Blackwell, L. Breiman, and A. J. Thomasian, "Proof of Shannon's transmission theorem for finite-state indecomposable channels," Ann. Math. Statist., vol.29, no.4, pp. 1209-1220, 1958.
    • (1958) Ann. Math. Statist. , vol.29 , Issue.4 , pp. 1209-1220
    • Blackwell, D.1    Breiman, L.2    Thomasian, A.J.3
  • 6
    • 0030150289 scopus 로고    scopus 로고
    • Capacity, mutual information, and coding for finite-state Markov channels
    • Mar.
    • A. J. Goldsmith and P. P. Varaiya, "Capacity, mutual information, and coding for finite-state Markov channels," IEEE Trans. Inf. Theory, vol.IT-42, pp. 868-886, Mar. 1996.
    • (1996) IEEE Trans. Inf. Theory , vol.IT-42 , pp. 868-886
    • Goldsmith, A.J.1    Varaiya, P.P.2
  • 7
    • 33746645650 scopus 로고    scopus 로고
    • Capacity of finite state channels based on Lyapunov exponents of random matrices
    • Aug.
    • T. Holliday, A. Goldsmith, and P. Glynn, "Capacity of finite state channels based on Lyapunov exponents of random matrices," IEEE Trans. Inf. Theory, vol.IT-52, pp. 3509-3532, Aug. 2006.
    • (2006) IEEE Trans. Inf. Theory , vol.IT-52 , pp. 3509-3532
    • Holliday, T.1    Goldsmith, A.2    Glynn, P.3
  • 8
  • 9
    • 58249125918 scopus 로고    scopus 로고
    • The capacity of channels with feedback
    • Jan.
    • S. Tatikonda and S. Mitter, "The capacity of channels with feedback," IEEE Trans. Inf. Theory, vol.IT-55, pp. 323-349, Jan. 2009.
    • (2009) IEEE Trans. Inf. Theory , vol.IT-55 , pp. 323-349
    • Tatikonda, S.1    Mitter, S.2
  • 10
    • 0344438837 scopus 로고
    • The capacities of certain channel classes under random coding
    • D. Blackwell, L. Breiman, and A. J. Thomasian, "The capacities of certain channel classes under random coding," Ann. Math. Statist., vol.31, no.3, pp. 558-567, 1960.
    • (1960) Ann. Math. Statist. , vol.31 , Issue.3 , pp. 558-567
    • Blackwell, D.1    Breiman, L.2    Thomasian, A.J.3
  • 11
    • 0032182921 scopus 로고    scopus 로고
    • Relieble communication under channel uncertainty
    • Jun.
    • A. Lapidoth and P. Narayan, "Relieble communication under channel uncertainty," IEEE Trans. Inf. Theory, vol.IT-44, pp. 2148-2177, Jun. 1998.
    • (1998) IEEE Trans. Inf. Theory , vol.IT-44 , pp. 2148-2177
    • Lapidoth, A.1    Narayan, P.2
  • 12
    • 0019148101 scopus 로고
    • Coding for channel with random parameters
    • S. I. Gel'fand and M. S. Pinsker, "Coding for channel with random parameters," Probl. Inf. Control, vol.9, no.1, pp. 19-31, 1980.
    • (1980) Probl. Inf. Control , vol.9 , Issue.1 , pp. 19-31
    • Gel'Fand, S.I.1    Pinsker, M.S.2
  • 13
    • 39049166566 scopus 로고    scopus 로고
    • The arbitrarily varying degraded broadcast channel with states known at the encoder
    • Seattle, WA
    • A. Winshtok and Y. Steinberg, "The arbitrarily varying degraded broadcast channel with states known at the encoder," in Proc. Int. Symp. Inf. Theory (ISIT), Seattle, WA, 2006, pp. 2156-2160.
    • (2006) Proc. Int. Symp. Inf. Theory (ISIT) , pp. 2156-2160
    • Winshtok, A.1    Steinberg, Y.2
  • 14
    • 23844437377 scopus 로고    scopus 로고
    • Coding for the degraded broadcast channel with random parameters, with causal and noncausal side information
    • Aug.
    • Y. Steinberg, "Coding for the degraded broadcast channel with random parameters, with causal and noncausal side information," IEEE Trans. Inf. Theory, vol.IT-51, pp. 2867-2877, Aug. 2005.
    • (2005) IEEE Trans. Inf. Theory , vol.IT-51 , pp. 2867-2877
    • Steinberg, Y.1
  • 15
    • 66949160418 scopus 로고    scopus 로고
    • Capacity region of the finitestate multiple-access channel with and without Feedback
    • Jun.
    • H. Permuter, T.Weissman, and J. Chen, "Capacity region of the finitestate multiple-access channel with and without Feedback," IEEE Trans. Inf. Theory, vol.IT-55, pp. 2455-2477, Jun. 2009.
    • (2009) IEEE Trans. Inf. Theory , vol.IT-55 , pp. 2455-2477
    • Permuter, H.1    Weissman, T.2    Chen, J.3
  • 16
    • 0013082133 scopus 로고
    • Capacity and coding for degraded broadcast channels
    • R. G. Gallager, "Capacity and coding for degraded broadcast channels," Problemy Peredachi Informatsii, vol.10, no.3, pp. 3-14, 1974.
    • (1974) Problemy Peredachi Informatsii , vol.10 , Issue.3 , pp. 3-14
    • Gallager, R.G.1
  • 17
    • 0015601146 scopus 로고
    • Random coding theorem for broadcast channels with degraded components
    • Feb.
    • P. P. Bergmans, "Random coding theorem for broadcast channels with degraded components," IEEE Trans. Inf. Theory, vol.IT-19, pp. 197-207, Feb. 1973.
    • (1973) IEEE Trans. Inf. Theory , vol.IT-19 , pp. 197-207
    • Bergmans, P.P.1
  • 19
    • 61349094791 scopus 로고    scopus 로고
    • Optimization of information rate upper and lower bounds for channels with memory
    • Feb.
    • P. Sadeghi, P. O. Vontobel, and R. Shams, "Optimization of information rate upper and lower bounds for channels with memory," IEEE Trans. Inf. Theory, vol.IT-55, pp. 663-688, Feb. 2009.
    • (2009) IEEE Trans. Inf. Theory , vol.IT-55 , pp. 663-688
    • Sadeghi, P.1    Vontobel, P.O.2    Shams, R.3
  • 20
    • 0035094678 scopus 로고    scopus 로고
    • The capacity region of broadcast channels with intersymbol interference and colored Gaussian noise
    • Jan.
    • 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, Jan. 2001.
    • (2001) IEEE Trans. Inf. Theory , vol.IT-47 , pp. 219-240
    • Goldsmith, A.J.1    Effros, M.2
  • 21
    • 0032071770 scopus 로고    scopus 로고
    • The compound channel capacity of a class of finite-state channels
    • Mar.
    • A. Lapidoth and I. E. Telater, "The compound channel capacity of a class of finite-state channels," IEEE Trans. Inf. Theory, vol.IT-44, pp. 973-983, Mar. 1998.
    • (1998) IEEE Trans. Inf. Theory , vol.IT-44 , pp. 973-983
    • Lapidoth, A.1    Telater, I.E.2
  • 23
    • 0013135102 scopus 로고
    • Causality, feedback and directed information
    • Waikiki, HI, Nov.
    • J. L. Massey, "Causality, feedback and directed information," in Proc. Int. Symp. Inf. Theory and its Appl., Waikiki, HI, Nov. 1990, pp. 303-305.
    • (1990) Proc. Int. Symp. Inf. Theory and Its Appl. , pp. 303-305
    • Massey, J.L.1
  • 24
    • 0001829182 scopus 로고
    • On the convergence of sequences of convex sets in finite dimensions
    • Jan.
    • G. Salinetti and R. J.-B. Wets, "On the convergence of sequences of convex sets in finite dimensions," SIAM Rev., vol.21, no.1, pp. 18-33, Jan. 1979.
    • (1979) SIAM Rev , vol.21 , Issue.1 , pp. 18-33
    • Salinetti, G.1    Wets, R.J.-B.2
  • 26
    • 0347769186 scopus 로고
    • Cardinality bounds on auxiliary variables in multiple-user theory via the method of ahlswede and Körner
    • Stanford Univ., Dep. Statist., Stanford, CA
    • M. Salehi, Cardinality Bounds on Auxiliary Variables in Multiple-User Theory via the Method of Ahlswede and Körner. Stanford Univ., Dep. Statist., Stanford, CA, 1978, Technical Report No. 33.
    • (1978) Technical Report 33
    • Salehi, M.1
  • 27
    • 0017970206 scopus 로고
    • The feedback capacity of degraded broadcast channels
    • Mar.
    • A. El-Gamal, "The feedback capacity of degraded broadcast channels," IEEE Trans. Inf. Theory, vol.IT-24, pp. 379-381, Mar. 1978.
    • (1978) IEEE Trans. Inf. Theory , vol.IT-24 , pp. 379-381
    • El-Gamal, A.1
  • 28
    • 0024771807 scopus 로고
    • Capacity and coding for the Gilbert-Elliott channel
    • Jun.
    • M. Mushkin and I. Bar-David, "Capacity and coding for the Gilbert-Elliott channel," IEEE Trans. Inf. Theory, vol.IT-35, pp. 1277-1290, Jun. 1989.
    • (1989) IEEE Trans. Inf. Theory , vol.IT-35 , pp. 1277-1290
    • Mushkin, M.1    Bar-David, I.2
  • 30
    • 33749436852 scopus 로고    scopus 로고
    • Achievable rates for the broadcast channel with states known at the transmitter
    • Adelaide, Australia
    • Y. Steinberg and S. Shamai, "Achievable rates for the broadcast channel with states known at the transmitter," in Proc. Int. Symp. Inf. Theory (ISIT), Adelaide, Australia, 2005, p. 2184.
    • (2005) Proc. Int. Symp. Inf. Theory (ISIT) , pp. 2184
    • Steinberg, Y.1    Shamai, S.2
  • 31
    • 0024668728 scopus 로고
    • Multiple-access channels with memory with and without frame synchronism
    • Mar.
    • S. Verdu, "Multiple-access channels with memory with and without frame synchronism," IEEE Trans. Inf. Theory, vol.IT-35, pp. 605-619, Mar. 1989.
    • (1989) IEEE Trans. Inf. Theory , vol.IT-35 , pp. 605-619
    • Verdu, S.1
  • 32
    • 0024705423 scopus 로고
    • The capacity region of the symbols-asynchronous Gaussain multiple-access channel
    • Apr.
    • S. Verdu, "The capacity region of the symbols-asynchronous Gaussain multiple-access channel," IEEE Trans. Inf. Theory, vol.IT-35, pp. 733-751, Apr. 1989.
    • (1989) IEEE Trans. Inf. Theory , vol.IT-35 , pp. 733-751
    • Verdu, S.1
  • 33
    • 0037272042 scopus 로고    scopus 로고
    • Capacity results for the discrete memoryless network
    • Jan.
    • G. Kramer, "Capacity results for the discrete memoryless network," IEEE Trans. Inf. Theory, vol.IT-49, pp. 4-21, Jan. 2003.
    • (2003) IEEE Trans. Inf. Theory , vol.IT-49 , pp. 4-21
    • Kramer, G.1
  • 34
    • 0001371497 scopus 로고
    • Two-way communication channels
    • C. E. Shannon, J. Neyman Ed. Berkeley, CA
    • C. E. Shannon, J. Neyman, Ed., "Two-way communication channels," in Proc. 4th Berkeley Symp. Math. Statist. Probabil., Berkeley, CA, 1961, vol.1, pp. 611-644.
    • (1961) Proc. 4th Berkeley Symp. Math. Statist. Probabil. , vol.1 , pp. 611-644
  • 35
    • 0016576623 scopus 로고
    • Source coding with side information and a converse for degraded broadcast channels
    • Nov.
    • R. F. Ahlswede and J. Körner, "Source coding with side information and a converse for degraded broadcast channels," IEEE Trans. Inf. Thoery, vol.IT-21, pp. 629-637, Nov. 1975.
    • (1975) IEEE Trans. Inf. Thoery , vol.IT-21 , pp. 629-637
    • Ahlswede, R.F.1    Körner, J.2
  • 36
    • 0010704427 scopus 로고
    • On extreme points of regular convex sets
    • M. Krein and D. Milman, "On extreme points of regular convex sets," Studia Mathematica, vol.9, pp. 133-138, 1940.
    • (1940) Studia Mathematica , vol.9 , pp. 133-138
    • Krein, M.1    Milman, D.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.