메뉴 건너뛰기




Volumn 61, Issue 5, 2015, Pages 2478-2487

An Equivalence Between Network Coding and Index Coding

Author keywords

Communication networks; network coding

Indexed keywords

CODES (SYMBOLS); TELECOMMUNICATION NETWORKS;

EID: 84928599979     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2015.2414926     Document Type: Article
Times cited : (123)

References (23)
  • 4
    • 0242334165 scopus 로고    scopus 로고
    • An algebraic approach to network coding
    • Oct.
    • R. Koetter and M. Medard, "An algebraic approach to network coding," IEEE/ACM Trans. Netw., vol. 11, no. 5, pp. 782-795, Oct. 2003.
    • (2003) IEEE/ACM Trans. Netw. , vol.11 , Issue.5 , pp. 782-795
    • Koetter, R.1    Medard, M.2
  • 5
    • 20544473127 scopus 로고    scopus 로고
    • Polynomial time algorithms for multicast network code construction
    • Jun.
    • S. Jaggi et al., "Polynomial time algorithms for multicast network code construction," IEEE Trans. Inf. Theory, vol. 51, no. 6, pp. 1973-1982, Jun. 2005.
    • (2005) IEEE Trans. Inf. Theory , vol.51 , Issue.6 , pp. 1973-1982
    • Jaggi, S.1
  • 6
    • 33947399169 scopus 로고    scopus 로고
    • A random linear network coding approach to multicast
    • Oct.
    • T. Ho et al., "A random linear network coding approach to multicast," IEEE Trans. Inf. Theory, vol. 52, no. 10, pp. 4413-4430, Oct. 2006.
    • (2006) IEEE Trans. Inf. Theory , vol.52 , Issue.10 , pp. 4413-4430
    • Ho, T.1
  • 9
    • 54749110342 scopus 로고    scopus 로고
    • Dualities between entropy functions and network codes
    • Oct.
    • T. Chan and A. Grant, "Dualities between entropy functions and network codes," IEEE Trans. Inf. Theory, vol. 54, no. 10, pp. 4470-4487, Oct. 2008.
    • (2008) IEEE Trans. Inf. Theory , vol.54 , Issue.10 , pp. 4470-4487
    • Chan, T.1    Grant, A.2
  • 14
    • 79251507985 scopus 로고    scopus 로고
    • On the hardness of approximating the network coding capacity
    • Feb.
    • M. Langberg and A. Sprintson, "On the hardness of approximating the network coding capacity," IEEE Trans. Inf. Theory, vol. 57, no. 2, pp. 1008-1014, Feb. 2011.
    • (2011) IEEE Trans. Inf. Theory , vol.57 , Issue.2 , pp. 1008-1014
    • Langberg, M.1    Sprintson, A.2
  • 17
    • 23844535205 scopus 로고    scopus 로고
    • Insufficiency of linear coding in network information flow
    • Aug.
    • R. Dougherty, C. Freiling, and K. Zeger, "Insufficiency of linear coding in network information flow," IEEE Trans. Inf. Theory, vol. 51, no. 8, pp. 2745-2759, Aug. 2005.
    • (2005) IEEE Trans. Inf. Theory , vol.51 , Issue.8 , pp. 2745-2759
    • Dougherty, R.1    Freiling, C.2    Zeger, K.3
  • 20
    • 84890349793 scopus 로고    scopus 로고
    • On a capacity equivalence between network and index coding and the edge removal problem
    • M. F. Wong, M. Langberg, and M. Effros, "On a capacity equivalence between network and index coding and the edge removal problem," in Proc. Int. Symp. Inf. Theory, Jul. 2013, pp. 972-976.
    • Proc. Int. Symp. Inf. Theory, Jul. 2013 , pp. 972-976
    • Wong, M.F.1    Langberg, M.2    Effros, M.3


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