Self-Repairing Codes for distributed storage - A projective geometric construction

2011 IEEE Information Theory Workshop, ITW 2011

Volumn , Issue , 2011, Pages 30-34

  Oggier, Frédérique ^a   Datta, Anwitaman ^b  

^a NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

^b NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

Author keywords

coding; distributed storage; projective geometry; self repair

Indexed keywords

CODING; DISTRIBUTED STORAGE; FAILED NODES; GEOMETRIC CONSTRUCTION; NODE FAILURE; PROJECTIVE GEOMETRY; REPAIR MECHANISM; SELF REPAIRING; SELF-REPAIR;

GEOMETRY; REPAIR;

CODES (SYMBOLS);

EID: 83655164980     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ITW.2011.6089443     Document Type: Conference Paper

References (6)

1. J. André, "Uber nicht-desarguessche Ebenen mit transitiver Translationsgruppe," Math. Z., p. 156-186, 1954.
2. A. G. Dimakis, P. B. Godfrey, Y. Wu, M. Wainwright and K. Ramchandran, "Network Coding for Distributed Storage Systems" IEEE Transactions on Information Theory, Vol. 56, Issue 9, Sept. 2010.
3. J. Eisfeld and L. Storme, "Partial t-spreads and minimal t-covers in finite projective spaces", unpublished.
4. F. Oggier and A. Datta, "Self-repairing Homomorphic Codes for Distributed Storage Systems", INFOCOM 2011.
5. K. V. Rashmi, N. B. Shah, P. Vijay Kumar, K. Ramchandran, "Explicit Construction of Optimal Exact Regenerating Codes for Distributed Storage", Allerton 2009.
6. H. Weatherspoon, J. Kubiatowicz, "Erasure Coding vs. Replication: A Quantitative Comparison", IPTPS 2002.