메뉴 건너뛰기




Volumn , Issue , 2008, Pages 738-745

Relay networks with orthogonal components

Author keywords

[No Author keywords available]

Indexed keywords

ACHIEVABILITY; ACHIEVABLE RATES; CHANNEL GAINS; CUT SETS; FINITE FIELDS; GAUSSIAN RELAY NETWORKS; NESTED LATTICE CODES; NETWORK TOPOLOGIES; ORTHOGONAL COMPONENTS; PARALLEL RELAYS; RELAY NETWORKS; STRUCTURED CODES; TRANSMITTED SIGNALS; UPPER BOUNDS;

EID: 64549135426     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ALLERTON.2008.4797631     Document Type: Conference Paper
Times cited : (5)

References (24)
  • 3
    • 46749091720 scopus 로고    scopus 로고
    • Unicast transmission over multiple access erasure networks: Capacity and duality
    • Tahoe city, California, Sept
    • B. Smith and S. Vishwanath, "Unicast transmission over multiple access erasure networks: Capacity and duality," in IEEE Information Theory Workshop, Tahoe city, California, Sept. 2007.
    • (2007) IEEE Information Theory Workshop
    • Smith, B.1    Vishwanath, S.2
  • 4
    • 33745146830 scopus 로고    scopus 로고
    • The multicast capacity of deterministic relay networks with no interference
    • June
    • N. Ratnakar and G. Kramer, "The multicast capacity of deterministic relay networks with no interference," IEEE Trans. Inform. Theory, vol. 52, pp. 2425-2432, June 2006.
    • (2006) IEEE Trans. Inform. Theory , vol.52 , pp. 2425-2432
    • Ratnakar, N.1    Kramer, G.2
  • 5
    • 35148873336 scopus 로고    scopus 로고
    • Computing over multiple-access channels with connections to wireless network coding
    • Seattle, USA, July
    • B. Nazer and M. Gastpar, "Computing over multiple-access channels with connections to wireless network coding," in Proc. IEEE International Symp. Inform. Theory, Seattle, USA, July 2006.
    • (2006) Proc. IEEE International Symp. Inform. Theory
    • Nazer, B.1    Gastpar, M.2
  • 6
    • 84940643030 scopus 로고    scopus 로고
    • Lattice coding increases multicast rates for Gaussian multiple-access networks
    • Sept
    • B. Nazer and M. Gastpar, "Lattice coding increases multicast rates for Gaussian multiple-access networks," in Proc. 45th Annual Allerton Conference, Sept. 2007.
    • (2007) Proc. 45th Annual Allerton Conference
    • Nazer, B.1    Gastpar, M.2
  • 7
    • 35148814319 scopus 로고    scopus 로고
    • Computation over multiple-access channels
    • Oct
    • B. Nazer and M. Gastpar, "Computation over multiple-access channels," IEEE Trans. Inform. Theory, vol. 53, pp. 3498-3516, Oct. 2007.
    • (2007) IEEE Trans. Inform. Theory , vol.53 , pp. 3498-3516
    • Nazer, B.1    Gastpar, M.2
  • 10
    • 18544376387 scopus 로고    scopus 로고
    • Capacity of a class of relay channels with orthogonal components
    • May
    • A. El Gamal and S. Zahedi, "Capacity of a class of relay channels with orthogonal components," IEEE Tram. Inform. Theory, vol. 51, pp. 1815-1817, May 2005.
    • (2005) IEEE Tram. Inform. Theory , vol.51 , pp. 1815-1817
    • El Gamal, A.1    Zahedi, S.2
  • 12
    • 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
  • 13
    • 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, pp. 441-445, May 1983.
    • (1983) IEEE Trans. Inform. Theory , vol.IT-29 , pp. 441-445
    • Willems, F.M.J.1
  • 14
    • 0019080139 scopus 로고
    • Multiple access channels with arbitrarily correlated sources
    • Nov
    • T. M. Cover, A. El Gamal, and M. Salehi, "Multiple access channels with arbitrarily correlated sources," IEEE Trans. Inform. Theory, vol. IT-26, pp. 648-657, Nov. 1980.
    • (1980) IEEE Trans. Inform. Theory , vol.IT-26 , pp. 648-657
    • Cover, T.M.1    El Gamal, A.2    Salehi, M.3
  • 18
    • 33646039233 scopus 로고    scopus 로고
    • A separation theorem for single-source network coding
    • May
    • L. Song, R. W Yeung, and N. Cai, "A separation theorem for single-source network coding," IEEE Trans. Inform. Theory, vol. 52, pp. 1861-1871, May 2006.
    • (2006) IEEE Trans. Inform. Theory , vol.52 , pp. 1861-1871
    • Song, L.1    Yeung, R.W.2    Cai, N.3
  • 19
    • 5144221013 scopus 로고    scopus 로고
    • Achieving 1/2 log (1 + SNR) on the AWGN channel with lattice encoding and decoding
    • Oct
    • U. Erez and R. Zamir, "Achieving 1/2 log (1 + SNR) on the AWGN channel with lattice encoding and decoding," IEEE Trans. Inform. Theory, vol. 50, pp. 2293-2314, Oct. 2004.
    • (2004) IEEE Trans. Inform. Theory , vol.50 , pp. 2293-2314
    • Erez, U.1    Zamir, R.2
  • 20
    • 26844546304 scopus 로고    scopus 로고
    • Lattices which are good for (almost) everything
    • Oct
    • U. Erez, S. Litsyn, and R. Zamir, "Lattices which are good for (almost) everything," IEEE Trans. Inform. Theory, vol. 51, pp. 3401-3416, Oct. 2005.
    • (2005) IEEE Trans. Inform. Theory , vol.51 , pp. 3401-3416
    • Erez, U.1    Litsyn, S.2    Zamir, R.3
  • 21
    • 5144231861 scopus 로고    scopus 로고
    • On the role of MMSE estimation in approaching the information theoretic limits of linear Gaussian channels: Shannon meets Wiener
    • Oct
    • G. D. Forney Jr., "On the role of MMSE estimation in approaching the information theoretic limits of linear Gaussian channels: Shannon meets Wiener," in Proc. 41st Annual Allerton Conference, Oct. 2003.
    • (2003) Proc. 41st Annual Allerton Conference
    • Forney Jr., G.D.1
  • 22
    • 64549098745 scopus 로고    scopus 로고
    • Relay networks with orthogonal components
    • in preparation
    • W Nam and S.-Y. Chung, "Relay networks with orthogonal components," in preparation.
    • Nam, W.1    Chung, S.-Y.2


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