메뉴 건너뛰기




Volumn 2005, Issue , 2005, Pages 1737-1741

The capacity region of the strong interference channel with common information

Author keywords

[No Author keywords available]

Indexed keywords

INDEPENDENT MESSAGES; INTERFERENCE CHANNEL; PARTIAL MESSAGE EXCHANGE;

EID: 33847672301     PISSN: 10586393     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (31)

References (16)
  • 1
    • 0020749593 scopus 로고
    • The discrete memoryless multiple channel with partially cooperating encoders
    • May
    • F. M. J. Willems, "The discrete memoryless multiple channel with partially cooperating encoders," IEEE Trans. on Inf. Theory, vol. 29, no. 3, pp. 441-445, May 1983.
    • (1983) IEEE Trans. on Inf. Theory , vol.29 , Issue.3 , pp. 441-445
    • Willems, F.M.J.1
  • 3
    • 0141904486 scopus 로고    scopus 로고
    • A new achievable rate for cooperative diversity based on generalized writing on dirty paper
    • June
    • A. Høst-Madsen, "A new achievable rate for cooperative diversity based on generalized writing on dirty paper," in IEEE Int. Symp. Inf. Theory, June 2003, p. 317.
    • (2003) IEEE Int. Symp. Inf. Theory , pp. 317
    • Høst-Madsen, A.1
  • 4
    • 5044252440 scopus 로고    scopus 로고
    • On the achievable rate for receiver cooperation in ad-hoc networks
    • June
    • _, "On the achievable rate for receiver cooperation in ad-hoc networks," in IEEE Int. Symp. Inf. Theory, June 2004, p. 272.
    • (2004) IEEE Int. Symp. Inf. Theory , pp. 272
    • Høst-Madsen, A.1
  • 6
    • 19544365385 scopus 로고    scopus 로고
    • Transmitter cooperation in ad-hoc wireless networks: Does dirty-paper coding beat relaying?
    • Oct
    • C. Ng and A. Goldsmith, "Transmitter cooperation in ad-hoc wireless networks: Does dirty-paper coding beat relaying?" in IEEE Inf. Theory Workshop, Oct. 2004.
    • (2004) IEEE Inf. Theory Workshop
    • Ng, C.1    Goldsmith, A.2
  • 7
    • 84867491023 scopus 로고    scopus 로고
    • The discrete memoryless compound multiple access channel with conferencing encoders
    • Sept
    • I. Maric, R. D. Yates, and G. Kramer, "The discrete memoryless compound multiple access channel with conferencing encoders," in IEEE Int. Symp. Inf. Theory, Sept. 2005.
    • (2005) IEEE Int. Symp. Inf. Theory
    • Maric, I.1    Yates, R.D.2    Kramer, G.3
  • 8
    • 0017495152 scopus 로고
    • Two user communication channels
    • May
    • H. Sato, "Two user communication channels," IEEE Trans. on Inf. Theory, vol. 23, no. 3, p. 295, May 1977.
    • (1977) IEEE Trans. on Inf. Theory , vol.23 , Issue.3 , pp. 295
    • Sato, H.1
  • 9
    • 0017918923 scopus 로고
    • Interference channels
    • Jan
    • A. B. Carleial, "Interference channels," IEEE Trans. on Inf. Theory, vol. 24, no. 1, p. 60, Jan. 1978.
    • (1978) IEEE Trans. on Inf. Theory , vol.24 , Issue.1 , pp. 60
    • Carleial, A.B.1
  • 10
    • 0023420374 scopus 로고
    • The capacity region of the discrete memoryless interference channel with strong interference
    • Sept
    • M. H. M. Costa and A. A. E. Gamal, "The capacity region of the discrete memoryless interference channel with strong interference," IEEE Trans. on Inf. Theory, vol. 33, no. 5, pp. 710-711, Sept. 1987.
    • (1987) IEEE Trans. on Inf. Theory , vol.33 , Issue.5 , pp. 710-711
    • Costa, M.H.M.1    Gamal, A.A.E.2
  • 11
    • 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
  • 12
    • 0015667856 scopus 로고
    • A coding theorem for multiple access channels with correlated sources
    • 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, 1973.
    • (1973) Bell Syst. Tech. J , vol.52 , pp. 1037-1076
    • Slepian, D.1    Wolf, J.K.2
  • 13
    • 2442520794 scopus 로고
    • Informationtheoretical results for the discrete memoryless multiple access channel,
    • Ph.D. dissertation, Katholieke Universiteit Leuven, Belgium, Oct
    • F. M. J. Willems, "Informationtheoretical results for the discrete memoryless multiple access channel," Ph.D. dissertation, Katholieke Universiteit Leuven, Belgium, Oct. 1982.
    • (1982)
    • Willems, F.M.J.1
  • 15
    • 1842533560 scopus 로고    scopus 로고
    • Outer bounds on the capacity of gaussian interference channels
    • Mar
    • G. Kramer, "Outer bounds on the capacity of gaussian interference channels," IEEE Trans. on Inf. Theory, vol. 50, no. 53, pp. 581-586, Mar. 2004.
    • (2004) IEEE Trans. on Inf. Theory , vol.50 , Issue.53 , pp. 581-586
    • Kramer, G.1


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