메뉴 건너뛰기




Volumn , Issue , 2009, Pages 1150-1154

Existence and construction of capacity-achieving network codes for distributed storage

Author keywords

[No Author keywords available]

Indexed keywords

CODE CONSTRUCTION; DISTRIBUTED STORAGE; DISTRIBUTED STORAGE SYSTEM; ERASURE CODES; ERASURE CODING; FINITE FIELDS; INFORMATION FLOWS; NETWORK BANDWIDTH; NETWORK CODES; NETWORK CODING; NETWORK TRAFFIC; OPTIMAL CODES; OPTIMAL TRADEOFFS; STORAGE EFFICIENCY; STORAGE NODES; STORAGE SYSTEMS;

EID: 70449514563     PISSN: 21578102     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2009.5206008     Document Type: Conference Paper
Times cited : (15)

References (6)
  • 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. 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    Medard, M.2


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