메뉴 건너뛰기




Volumn 24, Issue 1, 1978, Pages 60-70

Interference Channels

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION THEORY - COMMUNICATION CHANNELS;

EID: 0017918923     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/TIT.1978.1055812     Document Type: Article
Times cited : (515)

References (17)
  • 1
    • 0015287303 scopus 로고
    • Broadcast channels
    • Jan.
    • T. M. Cover “Broadcast channels,” IEEE Trans. Inform. Theory, vol. IT-18, pp. 5–17, Jan. 1972.
    • (1972) IEEE Trans. Inform. Theory , vol.IT-18 , pp. 5-17
    • Cover, T.M.1
  • 2
    • 19544392969 scopus 로고
    • A coding theorem for multiple-access communications
    • presented at IEEE Int. Symp. on Information Theory, Asilomar, CA
    • H. Liao, “A coding theorem for multiple-access communications,” presented at IEEE Int. Symp. on Information Theory, Asilomar, CA, 1972.
    • (1972)
    • Liao, H.1
  • 3
    • 0015667856 scopus 로고
    • A coding theorem for multiple-access channels with correlated sources
    • Sept.
    • 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, Sept. 1973.
    • (1973) Bell Syst. Tech. J. , vol.52 , pp. 1037-1076
    • Slepian, D.1    Wolf, J.K.2
  • 4
    • 0016549557 scopus 로고
    • A case where interference does not reduce capacity
    • Sept.
    • A. B. Carleial “A case where interference 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
  • 5
    • 0004037683 scopus 로고
    • On the capacity of multiple-terminal communication networks
    • Stanford Electronics Lab. Rep. 6603-1, Stanford Univ., Stanford, CA, Aug.
    • —, “On the capacity of multiple-terminal communication networks,” Stanford Electronics Lab. Rep. 6603-1, Stanford Univ., Stanford, CA, Aug. 1975.
    • (1975)
    • Carleial, A.B.1
  • 6
    • 79251650070 scopus 로고
    • Two-user communication channels
    • Aloha System Tech. Rep. B75-29, University of Hawaii, Honolulu, HI, Oct.
    • H. Sato, “Two-user communication channels,” Aloha System Tech. Rep. B75-29, University of Hawaii, Honolulu, HI, Oct. 1975.
    • (1975)
    • Sato, H.1
  • 7
    • 84937656054 scopus 로고
    • A study on Gaussian two-user channels
    • Aloha System Tech. Rep. B76-2, University of Hawaii, Honolulu, HI, Jan.
    • —, “A study on Gaussian two-user channels,” Aloha System Tech. Rep. B76-2, University of Hawaii, Honolulu, HI, Jan. 1976.
    • (1976)
    • Sato, H.1
  • 8
    • 84937649259 scopus 로고
    • The Gaussian interference channel
    • presented at IEEE Int. Symp. on Information Theory, Ronneby, Sweden
    • P. P. Bergmans, “The Gaussian interference channel,” presented at IEEE Int. Symp. on Information Theory, Ronneby, Sweden, 1976.
    • (1976)
    • Bergmans, P.P.1
  • 9
    • 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 of Probability, vol. 2, no. 5, pp. 805–814, 1974.
    • (1974) Annals of Probability , vol.2 , Issue.5 , pp. 805-814
    • Ahlswede, R.1
  • 10
    • 0016572325 scopus 로고
    • The capacity region of a channel with s senders and r receivers
    • Nov.
    • M. L. Ulrey “The capacity region of a channel with s senders and r receivers,” Informat. Contr., vol. 29, pp. 185–203, Nov. 1975.
    • (1975) Informat. Contr. , vol.29 , pp. 185-203
    • Ulrey, M.L.1
  • 11
    • 33747486011 scopus 로고
    • Information Theory
    • course notes for EE376, Stanford University Electrical Engineering Dept., Stanford, CA
    • G. D. Forney, “Information Theory,” course notes for EE376, Stanford University Electrical Engineering Dept., Stanford, CA, 1972.
    • (1972)
    • Forney, G.D.1
  • 12
    • 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
  • 13
    • 0015601146 scopus 로고
    • Random coding theorem for broadcast channels with degraded components
    • Mar.
    • P. P. Bergmans “Random coding theorem for broadcast channels with degraded components,” IEEE Trans. Inform. Theory, vol. IT-19, pp. 197–207, Mar. 1973.
    • (1973) IEEE Trans. Inform. Theory , vol.IT-19 , pp. 197-207
    • Bergmans, P.P.1
  • 14
    • 84890353460 scopus 로고
    • Coding for and decomposition of two-way channels
    • Jan.
    • F. Jelinek “Coding for and decomposition of two-way channels,” IEEE Trans. Inform. Theory, vol. IT-8, pp. 5–17, Jan. 1964.
    • (1964) IEEE Trans. Inform. Theory , vol.IT-8 , pp. 5-17
    • Jelinek, F.1
  • 15
    • 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


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