메뉴 건너뛰기




Volumn , Issue , 2010, Pages 1853-1857

Communicating the sum of sources in a 3-sources/3-terminals network; revisited

Author keywords

[No Author keywords available]

Indexed keywords

ACYCLIC NETWORKS; EDGE DISJOINT PATHS; ENTROPY SOURCES; IF THERE ARE; NETWORK CODING; SOURCE NODES; SUFFICIENT CONDITIONS; TWO SOURCES; UNIT CAPACITY;

EID: 77955674549     PISSN: 21578103     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2010.5513422     Document Type: Conference Paper
Times cited : (3)

References (6)
  • 1
    • 52349098512 scopus 로고    scopus 로고
    • Communicating the sum of sources over a network
    • A. Ramamoorthy, "Communicating the sum of sources over a network," in IEEE Intl. Symposium on Info. Th., 2008, pp. 1646-1650.
    • (2008) IEEE Intl. Symposium on Info. Th. , pp. 1646-1650
    • Ramamoorthy, A.1
  • 2
    • 70449478715 scopus 로고    scopus 로고
    • Communicating the sum of sources in a 3-sources/3-terminals network
    • M. Langberg and A. Ramamoorthy, "Communicating the sum of sources in a 3-sources/3-terminals network," in IEEE Intl. Symposium on Info. Th., 2009, pp. 2121-2125.
    • (2009) IEEE Intl. Symposium on Info. Th. , pp. 2121-2125
    • Langberg, M.1    Ramamoorthy, A.2
  • 3
    • 77950797691 scopus 로고    scopus 로고
    • Some results on communicating the sum of sources over a network
    • B. K. Rai, B. K. Dey, and A. Karandikar, "Some results on communicating the sum of sources over a network," in NetCod, 2009.
    • (2009) NetCod
    • Rai, B.K.1    Dey, B.K.2    Karandikar, A.3
  • 4
    • 33745155370 scopus 로고    scopus 로고
    • The encoding complexity of network coding
    • M. Langberg, A. Sprintson, and J. Bruck, "The encoding complexity of network coding," IEEE Trans. on Info. Th., vol. 52, no. 6, pp. 2386-2397, 2006.
    • (2006) IEEE Trans. on Info. Th. , vol.52 , Issue.6 , pp. 2386-2397
    • Langberg, M.1    Sprintson, A.2    Bruck, J.3


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