메뉴 건너뛰기




Volumn , Issue , 2006, Pages 1349-1353

On constructive multi-source network coding

Author keywords

[No Author keywords available]

Indexed keywords

ACHIEVABILITY THEOREM; ACYCLIC GRAPHS; MULTI-SOURCE NETWORK CODING; POLLUTION-FREE NETWORK;

EID: 39049137957     PISSN: 21578101     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2006.262046     Document Type: Conference Paper
Times cited : (25)

References (10)
  • 5
    • 0029277777 scopus 로고
    • Multilevel diversity coding with distortion
    • Mar
    • R. W. Yeung, "Multilevel diversity coding with distortion," IEEE Trans. Inform. Theory, vol. 41, pp. 412-422, Mar. 1995.
    • (1995) IEEE Trans. Inform. Theory , vol.41 , pp. 412-422
    • Yeung, R.W.1
  • 6
    • 0347337829 scopus 로고    scopus 로고
    • Zero-error network coding for acyclic networks
    • Dec
    • L. Song, R. W. Yeung, and N. Cai, "Zero-error network coding for acyclic networks," IEEE Trans. Inform. Theory, vol. 49, no. 12, pp. 3129-3139, Dec. 2003.
    • (2003) IEEE Trans. Inform. Theory , vol.49 , Issue.12 , pp. 3129-3139
    • Song, L.1    Yeung, R.W.2    Cai, N.3
  • 8
    • 0242334165 scopus 로고    scopus 로고
    • An algebraic approach to network coding
    • Oct
    • R. Koetter and M. Médard, "An algebraic approach to network coding," IEEE/ACM Trans. Networking, vol. 11, no. 5, pp. 782-795, Oct. 2003.
    • (2003) IEEE/ACM Trans. Networking , vol.11 , Issue.5 , pp. 782-795
    • Koetter, R.1    Médard, M.2


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