메뉴 건너뛰기




Volumn 56, Issue 12, 2010, Pages 6142-6158

Multiple multicasts with the help of a relay

Author keywords

Cognitive radio; lattice coding; multicasting; network coding; relay channel

Indexed keywords

ACHIEVABLE RATE REGION; BINARY LINEAR BLOCK CODES; CAPACITY REGIONS; COGNITIVE RADIO; COMPRESS AND FORWARD; DECODE-AND-FORWARD; DIRECT LINKS; GAUSSIAN CHANNELS; GENERAL MODEL; LATTICE CODES; LATTICE CODING; MULTICASTS; MULTIPLE ACCESS CHANNELS; MULTIPLE MESSAGES; NETWORK CODING; OPTIMALITY; OUTER BOUNDS; PHYSICAL LAYERS; RANDOM CODING; RELAY CHANNELS; RELAY STATIONS; RELAY TERMINALS; RELAYING STRATEGY; STRUCTURED CODES; UPPER BOUND;

EID: 78649364402     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2010.2079570     Document Type: Article
Times cited : (22)

References (34)
  • 1
    • 0018523303 scopus 로고
    • Capacity theorems for the relay channel
    • Sep.
    • T. M. Cover and A. El Gamal, "Capacity theorems for the relay channel," IEEE Trans. Inform. Theory, vol. IT-25, no. 5, pp. 572-584, Sep. 1979.
    • (1979) IEEE Trans. Inform. Theory , vol.IT-25 , Issue.5 , pp. 572-584
    • Cover, T.M.1    El Gamal, A.2
  • 2
    • 26444619804 scopus 로고    scopus 로고
    • Cooperative strategies and capacity theorems for relay networks
    • DOI 10.1109/TIT.2005.853304
    • 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, Sep. 2005. (Pubitemid 41430974)
    • (2005) IEEE Transactions on Information Theory , vol.51 , Issue.9 , pp. 3037-3063
    • Kramer, G.1    Gastpar, M.2    Gupta, P.3
  • 3
    • 0020749593 scopus 로고
    • The discrete memoryless multiple access channel with partially cooperating encoders
    • May
    • F. M. J. Willems, "The discrete memoryless multiple access channel with partially cooperating encoders," IEEE Trans. Inform. Theory, vol. IT-29, no. 3, pp. 441-445, May 1983.
    • (1983) IEEE Trans. Inform. Theory , vol.IT-29 , Issue.3 , pp. 441-445
    • Willems, F.M.J.1
  • 4
    • 0000456843 scopus 로고
    • The capacity region of a channel with two senders and two receivers
    • Oct.
    • R. Ahlswede, "The capacity region of a channel with two senders and two receivers," Ann. Probab., vol. 2, pp. 805-814, Oct. 1974.
    • (1974) Ann. Probab. , vol.2 , pp. 805-814
    • Ahlswede, R.1
  • 5
    • 35148812937 scopus 로고    scopus 로고
    • Rate regions for relay broadcast channels
    • DOI 10.1109/TIT.2007.904962, Special issue on Models, Theory, and Codes for Relaying and Cooperation in Communication Network
    • Y. Liang and G. Kramer, "Rate regions for relay broadcast channels," IEEE Trans. Inform. Theory, vol. 53, no. 10, pp. 3517-3535, Oct. 2007. (Pubitemid 47534511)
    • (2007) IEEE Transactions on Information Theory , vol.53 , Issue.10 , pp. 3517-3535
    • Liang, Y.1    Kramer, G.2
  • 6
    • 33847655677 scopus 로고    scopus 로고
    • Spectral efficient signaling for halfdu-plex relay channels
    • Systems and Computers, Pacific Grove, CA, Nov.
    • B. Rankov and A. Wittneben, "Spectral efficient signaling for halfdu-plex relay channels," in Proc. 39th IEEE Asilomar Conf. Signals, Systems and Computers, Pacific Grove, CA, Nov. 2005.
    • (2005) Proc. 39th IEEE Asilomar Conf. Signals
    • Rankov, B.1    Wittneben, A.2
  • 7
    • 64549157256 scopus 로고    scopus 로고
    • Rate regions for the separated two-way relay channel
    • Control, and Computing, Monticello IL Sep.
    • D. Gündüz, E. Tuncel, and J. Nayak, "Rate regions for the separated two-way relay channel," in Proc. Annu. Allerton Conf. Communication, Control, and Computing, Monticello, IL, Sep. 2008.
    • (2008) Proc. Annu. Allerton Conf. Communication
    • Gündüz, D.1    Tuncel, E.2    Nayak, J.3
  • 8
    • 50249137194 scopus 로고    scopus 로고
    • On achievable rates for interference relay channel with interference cancellation
    • Pacific Grove, CA Nov.
    • O. Sahin and E. Erkip, "On achievable rates for interference relay channel with interference cancellation," in Proc. 41st Annu. Asilomar Conf. Signals, Systems and Computers, Pacific Grove, CA, Nov. 2007.
    • (2007) Proc. 41st Annu. Asilomar Conf. Signals, Systems and Computers
    • Sahin, O.1    Erkip, E.2
  • 13
    • 33646045863 scopus 로고    scopus 로고
    • Achievable rates in cognitive radio channels
    • May
    • N. Devroye, P. Mitran, and V. Tarokh, "Achievable rates in cognitive radio channels," IEEE Trans. Inform. Theory, vol. 52, no. 5, pp. 1813-1827, May 2006.
    • (2006) IEEE Trans. Inform. Theory , vol.52 , Issue.5 , pp. 1813-1827
    • Devroye, N.1    Mitran, P.2    Tarokh, V.3
  • 14
    • 0022054657 scopus 로고
    • The discrete memoryless multiple-access channel with cribbing encoders
    • May
    • F. M. J. Willems and E. C. van der Meulen, "The discrete memoryless multiple-access channel with cribbing encoders," IEEE Trans. Inform. Theory, vol. IT-31, no. 5, pp. 313-327, May 1985.
    • (1985) IEEE Trans. Inform. Theory , vol.IT-31 , Issue.5 , pp. 313-327
    • Willems, F.M.J.1    Meulen Der Van, E.C.2
  • 15
    • 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
  • 16
    • 0021502824 scopus 로고
    • Transmission over a multiple access channel with a special source hierarchy
    • V. V. Prelov, Transmission over a multiple access channel with a special source hierarchy," Probl. Peredachi Inf., vol. 20., no 4,pp 3-10, 1984.
    • (1984) Probl. Peredachi Inf. , vol.20 , Issue.4 , pp. 3-10
    • Prelov, V.V.1
  • 17
    • 0018321062 scopus 로고
    • The capacity region of general multiple-access channel with certain correlated sources
    • Jan.
    • T. S. Han, "The capacity region of general multiple-access channel with certain correlated sources," Inform. and Control, vol. 40, no. 1, pp. 37-60, Jan. 1979.
    • (1979) Inform. and Control , vol.40 , Issue.1 , pp. 37-60
    • Han, T.S.1
  • 18
    • 77955680264 scopus 로고    scopus 로고
    • On the capacity region of a multiple access channel with common messages
    • Austin, TX, Jul.
    • D. Gündüz and O. Simeone, "On the capacity region of a multiple access channel with common messages," in Proc. IEEE Int. Symp. Information Theory (ISIT), Austin, TX, Jul. 2010.
    • (2010) Proc. IEEE Int. Symp. Information Theory (ISIT)
    • Gündüz, D.1    Simeone, O.2
  • 20
    • 77950254130 scopus 로고    scopus 로고
    • Wyner-Ziv coding over broadcast channels: Digital schemes
    • submitted for publication
    • J. Nayak, E. Tuncel, and D. Gündüz, "Wyner-Ziv coding over broadcast channels: Digital schemes," IEEE Trans. Inform. Theory, submitted for publication.
    • IEEE Trans. Inform. Theory
    • Nayak, J.1    Tuncel, E.2    Gündüz, D.3
  • 21
    • 0018442936 scopus 로고
    • How to encode the modulo-two sum of binary sources
    • Mar.
    • J. Körner and K. Marton, "How to encode the modulo-two sum of binary sources," IEEE Trans. Inform. Theory, vol. IT-25, pp. 219-221, Mar. 1979.
    • (1979) IEEE Trans. Inform. Theory , vol.IT-25 , pp. 219-221
    • Körner, J.1    Marton, K.2
  • 22
    • 5144221013 scopus 로고    scopus 로고
    • Achieving 1/2 log(l + SNR) on the AWGN channel with lattice encoding and decoding
    • Oct.
    • U. Erez and R. Zamir, "Achieving 1/2 log(l + SNR) on the AWGN channel with lattice encoding and decoding," IEEE Trans. Inform. Theory, vol. 50, no. 10, pp. 2293-2314, Oct. 2004.
    • (2004) IEEE Trans. Inform. Theory , vol.50 , Issue.10 , pp. 2293-2314
    • Erez, U.1    Zamir, R.2
  • 23
    • 0036611624 scopus 로고    scopus 로고
    • Nested linear/lattice codes for structured multiterminal binning
    • Jun.
    • R. Zamir, S. Shamai, and U. Erez, "Nested linear/lattice codes for structured multiterminal binning," IEEE Trans. Inform. Theory, vol. 48, no. 6, pp. 1250-1276, Jun. 2002.
    • (2002) IEEE Trans. Inform. Theory , vol.48 , Issue.6 , pp. 1250-1276
    • Zamir, R.1    Shamai, S.2    Erez, U.3
  • 24
    • 46749106780 scopus 로고    scopus 로고
    • The case for structured random codes in network capacity theorems
    • Apr.
    • B. Nazer and M. Gastpar, "The case for structured random codes in network capacity theorems," Eur. Trans. Telecommun., vol. 19, no. 4, pp. 455-474, Apr. 2008.
    • (2008) Eur. Trans. Telecommun. , vol.19 , Issue.4 , pp. 455-474
    • Nazer, B.1    Gastpar, M.2
  • 26
    • 77958563966 scopus 로고    scopus 로고
    • Joint physical layer coding and network coding for bi-directional relaying
    • submitted for publication
    • M. P. Wilson, K. Narayanan, H. Pfister, and A. Sprintson, "Joint physical layer coding and network coding for bi-directional relaying," IEEE Trans. Inform. Theory, submitted for publication.
    • IEEE Trans. Inform. Theory
    • Wilson, M.P.1    Narayanan, K.2    Pfister, H.3    Sprintson, A.4
  • 29
    • 51649116061 scopus 로고    scopus 로고
    • Achievable rates for the three user cooperative multiple access channel
    • Las Vegas, NV, Mar.
    • C. Edemen and O. Kaya, "Achievable rates for the three user cooperative multiple access channel," in Proc. IEEE Wireless Communications and Networking Conf, Las Vegas, NV, Mar. 2008.
    • (2008) Proc. IEEE Wireless Communications and Networking Conf
    • Edemen, C.1    Kaya, O.2
  • 30
    • 79960678507 scopus 로고    scopus 로고
    • Compute-and-forward: Harnessing interference through structured codes
    • submitted for publication
    • B. Nazer and M. Gastpar, "Compute-and-forward: Harnessing interference through structured codes," IEEE Trans. Inform. Theory, submitted for publication.
    • IEEE Trans. Inform. Theory
    • Nazer, B.1    Gastpar, M.2
  • 34
    • 0030105018 scopus 로고    scopus 로고
    • A rate-splitting approach to the Gaussian multiple-access channel
    • Mar.
    • B. Rimoldi and R. Urbanke, "A rate-splitting approach to the Gaussian multiple-access channel," IEEE Trans. Inform. Theory, vol. 42, no. 2, pp. 364-375, Mar. 1996
    • (1996) IEEE Trans. Inform. Theory , vol.42 , Issue.2 , pp. 364-375
    • Rimoldi, B.1    Urbanke, R.2


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