메뉴 건너뛰기




Volumn 2015-June, Issue , 2015, Pages 2251-2255

Approximate capacity of Gaussian relay networks: Is a sublinear gap to the cutset bound plausible?

Author keywords

[No Author keywords available]

Indexed keywords

GAUSSIAN DISTRIBUTION; RELAY CONTROL SYSTEMS;

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

References (15)
  • 2
    • 79952852802 scopus 로고    scopus 로고
    • Wireless network information flow: A deterministic approach
    • April
    • A. Avestimehr, S. Diggavi, and D. Tse, "Wireless network information flow: A deterministic approach, " Information Theory, IEEE Transactions on, vol. 57, no. 4, pp. 1872-1905, April 2011.
    • (2011) Information Theory, IEEE Transactions on , vol.57 , Issue.4 , pp. 1872-1905
    • Avestimehr, A.1    Diggavi, S.2    Tse, D.3
  • 3
    • 84889564298 scopus 로고    scopus 로고
    • Approximately achieving Gaussian relay network capacity with lattice-based QMF codes
    • Dec
    • A. Ozgur and S. Diggavi, "Approximately achieving Gaussian relay network capacity with lattice-based QMF codes, " Information Theory, IEEE Transactions on, vol. 59, no. 12, pp. 8275-8294, Dec 2013.
    • (2013) Information Theory, IEEE Transactions on , vol.59 , Issue.12 , pp. 8275-8294
    • Ozgur, A.1    Diggavi, S.2
  • 5
    • 80054798339 scopus 로고    scopus 로고
    • Compress-and-forward scheme for a relay network: Approximate optimality and connection to algebraic flows
    • July
    • A. Raja and P. Viswanath, "Compress-and-forward scheme for a relay network: Approximate optimality and connection to algebraic flows, " in Information Theory Proceedings (ISIT), 2011 IEEE International Symposium on, July 2011, pp. 1698-1702.
    • (2011) Information Theory Proceedings (ISIT), 2011 IEEE International Symposium on , pp. 1698-1702
    • Raja, A.1    Viswanath, P.2
  • 7
    • 84873179530 scopus 로고    scopus 로고
    • Achieving the capacity of the N-relay Gaussian diamond network within log n bits
    • Sept
    • B. Chern and A. Ozgur, "Achieving the capacity of the N-relay Gaussian diamond network within log n bits, " in Information Theory Workshop (ITW), 2012 IEEE, Sept 2012, pp. 377-380.
    • (2012) Information Theory Workshop (ITW), 2012 IEEE , pp. 377-380
    • Chern, B.1    Ozgur, A.2
  • 8
    • 84872583432 scopus 로고    scopus 로고
    • The approximate capacity of the Gaussian N-relay diamond network
    • Feb
    • U. Niesen and S. Diggavi, "The approximate capacity of the Gaussian N-relay diamond network, " Information Theory, IEEE Transactions on, vol. 59, no. 2, pp. 845-859, Feb 2013.
    • (2013) Information Theory, IEEE Transactions on , vol.59 , Issue.2 , pp. 845-859
    • Niesen, U.1    Diggavi, S.2
  • 12
    • 0024078766 scopus 로고
    • Partial converse for a relay channel
    • Z. Zhang, "Partial converse for a relay channel, " Information Theory, IEEE Transactions on, vol. 34, no. 5, pp. 1106-1110, 1988.
    • (1988) Information Theory, IEEE Transactions on , vol.34 , Issue.5 , pp. 1106-1110
    • Zhang, Z.1


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