메뉴 건너뛰기




Volumn 27, Issue 1, 1981, Pages 49-60

A New Achievable Rate Region for the Interference Channel

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION THEORY;

EID: 0019437605     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/TIT.1981.1056307     Document Type: Article
Times cited : (1312)

References (20)
  • 2
    • 0000456843 scopus 로고
    • The capacity region of a channel with two senders and two receivers
    • R. Ahlswede, “The capacity region of a channel with two senders and two receivers,” Annals Probabil., Vol. 2, No. 5, pp. 805–814, 1974.
    • (1974) Annals Probabil. , vol.2 , Issue.5 , pp. 805-814
    • Ahlswede, R.1
  • 3
    • 0017918923 scopus 로고
    • Interference channels
    • Jan.
    • A. B. Carleial, “Interference channels,” IEEE Trans. Inform. The-m, Vol. IT-24, pp. 60–70, Jan. 1978.
    • (1978) IEEE Trans. Inform. The-m , vol.IT-24 , pp. 60-70
    • Carleial, A.B.1
  • 4
    • 0016534173 scopus 로고
    • An achievable rate region for the broadcasting channel
    • July
    • T. M. Cover, “An achievable rate region for the broadcasting channel,” IEEE Trans. Inform. Theory, Vol. IT-21, pp. 399–404, July 1975.
    • (1975) IEEE Trans. Inform. Theory , vol.IT-21 , pp. 399-404
    • Cover, T.M.1
  • 5
    • 0017495152 scopus 로고
    • Two-user communication channels
    • May
    • H. Sato, “Two-user communication channels,” IEEE Trans. Inform. Theory, Vol. IT-23, pp. 295–304, May 1977.
    • (1977) IEEE Trans. Inform. Theory , vol.IT-23 , pp. 295-304
    • Sato, H.1
  • 6
    • 0016549557 scopus 로고
    • A case where intereference does not reduce capacity
    • Sept.
    • A. B. Carleial, “A case where intereference does not reduce capacity,” IEEE Trans. Inform. Theory, Vol. IT-21, pp. 569–570, Sept. 1975.
    • (1975) IEEE Trans. Inform. Theory , vol.IT-21 , pp. 569-570
    • Carleial, A.B.1
  • 7
    • 0018441372 scopus 로고
    • The capacity region of a class of discrete additive degraded interference channels
    • Mar.
    • 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.
    • (1979) IEEE Trans. Inform. Theory , vol.IT-25 , pp. 228-231
    • Benzel, R.1
  • 8
    • 0003307426 scopus 로고
    • Multiterminal source coding
    • Vienna; Springer CISM Courses and Lectures
    • T. Berger, “Multiterminal source coding,” in The Information The-ory Approach to Communications, G. Longo, Ed. Vienna; Springer, pp. 172–231, CISM Courses and Lectures, No. 229, 1978.
    • (1978) The Information The-ory Approach to Communications , Issue.229 , pp. 172-231
    • Berger, T.1    Longo, G.2
  • 9
    • 0016486048 scopus 로고
    • A proof of the data compression theorem of Slepian and Wolf for ergodic sources
    • Mar.
    • T. M. Cover, “A proof of the data compression theorem of Slepian and Wolf for ergodic sources,” IEEE Trans. Inform. Theory, Vol. IT-21, pp. 226–228. Mar. 1975.
    • (1975) IEEE Trans. Inform. Theory , vol.IT-21 , pp. 226-228
    • Cover, T.M.1
  • 10
    • 0019013156 scopus 로고
    • A unified achievable rate region for a general class of multiterminal source coding systems
    • May
    • T. S. Han and K. Kobayashi, “A unified achievable rate region for a general class of multiterminal source coding systems,” IEEE Trans. Inform. Theory, Vol. IT-26, pp. 277–288, May 1980.
    • (1980) IEEE Trans. Inform. Theory , vol.IT-26 , pp. 277-288
    • Han, T.S.1    Kobayashi, K.2
  • 12
    • 0018321062 scopus 로고
    • The capacity region of general multiple-access channel with certain correlated sources
    • T. S. Han, “The capacity region of general multiple-access channel with certain correlated sources,” Inform. Contr., Vol. 40, No. 1, pp. 37–60, 1979.
    • (1979) Inform. Contr. , vol.40 , Issue.1 , pp. 37-60
    • Han, T.S.1
  • 13
    • 84939005386 scopus 로고
    • Slepian-Wolf-Cover theorem for networks of channels
    • June Italy presented at IEEE Int. Symp. Information Theory, Grignano to be published
    • T. S. Han, “Slepian-Wolf-Cover theorem for networks of channels,” presented at IEEE Int. Symp. Information Theory, Grignano, Italy, June 25–29, 1979; Inform. Contr., to be published.
    • (1979) Inform. Contr , pp. 25-29
    • Han, T.S.1
  • 14
    • 0002195239 scopus 로고
    • Multi-way communication channels
    • Sept. 2–8 USSR, Academy Tsahkadsor, Armenia Hungarian of Sciences 1973
    • R. Ahlswede, “Multi-way communication channels,” in Proc. 2nd International Symp. on Information Theory, Tsahkadsor, Armenia, USSR, Sept. 2–8, 1971, pp. 23–52, Hungarian Academy of Sciences, 1973.
    • (1973) Proc. 2nd International Symp. on Information Theory , pp. 23-52
    • Ahlswede, R.1
  • 15
    • 0018293052 scopus 로고
    • Evaluation of an achievable rate region for the broadcasting channel
    • Jan.
    • B. E. Hajek and M. B. Pursley, “Evaluation of an achievable rate region for the broadcasting channel,” IEEE Trans. Inform. Theory, Vol. IT-25, pp. 36–46, Jan. 1979.
    • (1979) IEEE Trans. Inform. Theory , vol.IT-25 , pp. 36-46
    • Hajek, B.E.1    Pursley, M.B.2
  • 16
  • 17
    • 0015992185 scopus 로고
    • Recent results in the Shannon theory
    • Jan.
    • A. D. Wyner, “Recent results in the Shannon theory,” IEEE Trans. Inform. Theory, Vol. IT-20, pp. 2–10, Jan. 1974.
    • (1974) IEEE Trans. Inform. Theory , vol.IT-20 , pp. 2-10
    • Wyner, A.D.1
  • 19
    • 0018467106 scopus 로고
    • Source coding with cross observation at the encoders
    • May
    • T. S. Han, “Source coding with cross observation at the encoders,” IEEE Trans. Inform. Theory, Vol. IT-25, pp. 360–361, May 1979.
    • (1979) IEEE Trans. Inform. Theory , vol.IT-25 , pp. 360-361
    • Han, T.S.1
  • 20
    • 0018467629 scopus 로고
    • A coding theorem for the discrete memoryless broadcast channel
    • May
    • K. Marton, “A coding theorem for the discrete memoryless broadcast channel,” IEEE Trans. Inform. Theory. Vol. IT-25, pp. 306–311, May 1979.
    • (1979) IEEE Trans. Inform. Theory , vol.IT-25 , pp. 306-311
    • Marton, K.1


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