메뉴 건너뛰기




Volumn 2005-January, Issue , 2005, Pages

The discrete memoryless compound multiple access channel with conferencing encoders

Author keywords

[No Author keywords available]

Indexed keywords

SIGNAL ENCODING;

EID: 84867491023     PISSN: 21578095     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2005.1523365     Document Type: Conference Paper
Times cited : (16)

References (15)
  • 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 Inform. Theory, vol. 29, no. 3, pp. 441-445, May 1983.
    • (1983) IEEE Trans. On Inform. Theory , vol.29 , Issue.3 , pp. 441-445
    • Willems, F.M.J.1
  • 2
    • 0017495152 scopus 로고
    • Two user communication channels
    • May
    • H. Sato, “Two user communication channels,” IEEE Trans. on Inform. Theory, vol. 23, no. 3, p. 295, May 1977.
    • (1977) IEEE Trans. On Inform. Theory , vol.23 , Issue.3 , pp. 295
    • Sato, H.1
  • 3
    • 0017918923 scopus 로고
    • Interference channels
    • Jan
    • A. B. Carleial, “Interference channels,” IEEE Trans. on Inform. Theory, vol. 24, no. 1, p. 60, Jan. 1978.
    • (1978) IEEE Trans. On Inform. Theory , vol.24 , Issue.1 , pp. 60
    • Carleial, A.B.1
  • 4
    • 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 Inform. Theory, vol. 33, no. 5, pp. 710-711, Sept. 1987.
    • (1987) IEEE Trans. On Inform. Theory , vol.33 , Issue.5 , pp. 710-711
    • Costa, M.H.M.1    Gamal, A.A.E.2
  • 5
    • 0017971344 scopus 로고
    • On the capacity region of a discrete two-user channel for strong interference
    • May
    • H. Sato, “On the capacity region of a discrete two-user channel for strong interference,” IEEE Trans. on Inform. Theory, vol. 24, no. 3, pp. 377-379, May 1978.
    • (1978) IEEE Trans. On Inform. Theory , vol.24 , Issue.3 , pp. 377-379
    • Sato, H.1
  • 6
    • 0018030822 scopus 로고
    • A discrete two-user channel with strong interference
    • Nov
    • H. Sato and M. Tanabe, “A discrete two-user channel with strong interference,” in Trans. Inst. Electron. Commun. Eng., Japan, vol. 61, Nov. 1978, pp. 880-884.
    • (1978) Trans. Inst. Electron. Commun. Eng., Japan , vol.61 , pp. 880-884
    • Sato, H.1    Tanabe, M.2
  • 7
    • 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
  • 9
    • 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. Inform. Theory, June 2003, p. 317.
    • (2003) IEEE Int. Symp. Inform. Theory , pp. 317
    • Høst-Madsen, A.1
  • 10
    • 5044252440 scopus 로고    scopus 로고
    • On the achievable rate for receiver cooperation in ad-hoc networks
    • June
    • A. Høst-Madsen, “On the achievable rate for receiver cooperation in ad-hoc networks,” in IEEE Int. Symp. Inform. Theory, June 2004, p. 272.
    • (2004) IEEE Int. Symp. Inform. Theory , pp. 272
    • Høst-Madsen, A.1
  • 12
    • 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 Inform. Theory Workshop, Oct. 2004.
    • (2004) IEEE Inform. Theory Workshop
    • Ng, C.1    Goldsmith, A.2
  • 14
    • 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


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