메뉴 건너뛰기




Volumn , Issue , 2006, Pages

Relay channel with private messages

Author keywords

[No Author keywords available]

Indexed keywords

BROADCASTING; DECODING; GAUSSIAN DISTRIBUTION; MESSAGE PASSING; SIGNAL ENCODING;

EID: 50949127090     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/GLOCOM.2006.106     Document Type: Conference Paper
Times cited : (1)

References (15)
  • 1
    • 0015034528 scopus 로고
    • Three-terminal communication channels
    • E. C. van der Meulen, "Three-terminal communication channels," Adv. Appl. Probab., vol. 3, pp. 120-154, 1971.
    • (1971) Adv. Appl. Probab , vol.3 , pp. 120-154
    • van der Meulen, E.C.1
  • 2
    • 0018523303 scopus 로고
    • Capacity theorems for the relay channel
    • T. Cover and A. E. Gamal, "Capacity theorems for the relay channel," IEEE Trans. Inform. Theory, vol. 25, no. 5, pp. 572-584, 1979.
    • (1979) IEEE Trans. Inform. Theory , vol.25 , Issue.5 , pp. 572-584
    • Cover, T.1    Gamal, A.E.2
  • 3
    • 4344559690 scopus 로고    scopus 로고
    • Fading relay channels: Performance limits and space-time signal design
    • R. U. Nabar, H. Bolcskei, and F. W. Kneubuhler, "Fading relay channels: performance limits and space-time signal design," IEEE J. Select. Areas Commun., vol. 22, no. 6, pp. 1099-1109, 2004.
    • (2004) IEEE J. Select. Areas Commun , vol.22 , Issue.6 , pp. 1099-1109
    • Nabar, R.U.1    Bolcskei, H.2    Kneubuhler, F.W.3
  • 4
    • 26444619804 scopus 로고    scopus 로고
    • Cooperative strategies and capacity theorems for relay networks
    • G. Kramer, M. Gastpar, and P. Gupta, "Cooperative strategies and capacity theorems for relay networks," IEEE Trans. Inform. Theory, vol. 51, no. 9, pp. 3037-3063, 2005.
    • (2005) IEEE Trans. Inform. Theory , vol.51 , Issue.9 , pp. 3037-3063
    • Kramer, G.1    Gastpar, M.2    Gupta, P.3
  • 5
    • 33847366332 scopus 로고    scopus 로고
    • The three node wireless network: Achievable rates and cooperation strategies
    • L. Lai, K. Liu, and H. El Gamal, "The three node wireless network: Achievable rates and cooperation strategies," IEEE Trans. Inform. Theory, vol. 52, no. 3, pp. 805-828, 2006.
    • (2006) IEEE Trans. Inform. Theory , vol.52 , Issue.3 , pp. 805-828
    • Lai, L.1    Liu, K.2    El Gamal, H.3
  • 6
    • 33947709388 scopus 로고    scopus 로고
    • Cooperative relay broadcast channels
    • submitted for publication, Online, Available
    • Y. Liang and V. V. Veeravalli, "Cooperative relay broadcast channels," IEEE Trans. Inform. Theory, submitted for publication. [Online]. Available: http://www.princeton.edu/~yingbinl/publication.html
    • IEEE Trans. Inform. Theory
    • Liang, Y.1    Veeravalli, V.V.2
  • 8
    • 0032184236 scopus 로고    scopus 로고
    • Comments on broadcast channels
    • T. M. Cover, "Comments on broadcast channels," IEEE Trans. Inform. Theory, vol. 44, no. 6, pp. 2524-2530, 1998.
    • (1998) IEEE Trans. Inform. Theory , vol.44 , Issue.6 , pp. 2524-2530
    • Cover, T.M.1
  • 9
    • 2442520794 scopus 로고
    • Informationtheoretical results for the discrete memoryless multiple access channel,
    • Ph.D. dissertation, Katholieke Univ. Leuven, Leuven, Belgium, October
    • F. M. J. Willems, "Informationtheoretical results for the discrete memoryless multiple access channel," Ph.D. dissertation, Katholieke Univ. Leuven, Leuven, Belgium, October 1982.
    • (1982)
    • Willems, F.M.J.1
  • 11
    • 0018467629 scopus 로고
    • A coding theorem for the discrete memoryless broadcast channel
    • K. Marton, "A coding theorem for the discrete memoryless broadcast channel," IEEE Trans. Inform. Theory, vol. 25, no. 3, pp. 306-311, 1979.
    • (1979) IEEE Trans. Inform. Theory , vol.25 , Issue.3 , pp. 306-311
    • Marton, K.1
  • 12
    • 0016882596 scopus 로고
    • The rate-distortion function for source coding with side information at the decoder
    • A. Wyner and J. Ziv, "The rate-distortion function for source coding with side information at the decoder," IEEE Trans. Inform. Theory, vol. 22, no. 1, pp. 1-10, 1976.
    • (1976) IEEE Trans. Inform. Theory , vol.22 , Issue.1 , pp. 1-10
    • Wyner, A.1    Ziv, J.2
  • 14
    • 77954553161 scopus 로고
    • A proof of Marton's coding theorem for the discrete memoryless broadcast channel
    • A. A. E. Gamal and E. C. van der Meulen, "A proof of Marton's coding theorem for the discrete memoryless broadcast channel," IEEE Trans. Inform. Theory, vol. 27, pp. 120-122, 1981.
    • (1981) IEEE Trans. Inform. Theory , vol.27 , pp. 120-122
    • Gamal, A.A.E.1    van der Meulen, E.C.2
  • 15
    • 0020752342 scopus 로고
    • Writing on dirty paper
    • M. Costa, "Writing on dirty paper," IEEE Trans. Inform. Theory, vol. 29, pp. 439-441, 1983.
    • (1983) IEEE Trans. Inform. Theory , vol.29 , pp. 439-441
    • Costa, M.1


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