{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,14]],"date-time":"2026-05-14T07:19:29Z","timestamp":1778743169568,"version":"3.51.4"},"reference-count":43,"publisher":"Emerald","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,6,6]]},"abstract":"<jats:p>This survey comprises a tutorial on traditional erasure codes and their applications to networked distributed storage systems (NDSS), followed by a survey of novel code families tailor made for better repairability in NDSS.<\/jats:p>","DOI":"10.1561\/0100000068","type":"journal-article","created":{"date-parts":[[2013,6,6]],"date-time":"2013-06-06T06:04:42Z","timestamp":1370498682000},"page":"383-466","source":"Crossref","is-referenced-by-count":25,"title":["Coding Techniques for Repairability in Networked Distributed Storage Systems"],"prefix":"10.1108","volume":"9","author":[{"given":"Fr\u00e9d\u00e9rique","family":"Oggier","sequence":"first","affiliation":[{"name":"Division of Mathematical Sciences, School of Physical and Mathematical Sciences, Nanyang Technological University ,","place":["Singapore"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anwitaman","family":"Datta","sequence":"additional","affiliation":[{"name":"Division of Computer Science, School of Computer Engineering, Nanyang Technological University ,","place":["Singapore"]}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"140","published-online":{"date-parts":[[2013,6,6]]},"reference":[{"issue":"4","key":"2026032711582305700_ref001","article-title":"Network information flow","volume":"46","author":"Alshwede","year":"2000","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032711582305700_ref002","article-title":"Finding a needle in Haystack: Facebooks photo storage","volume-title":"OSDI","author":"Beaver","year":"2010"},{"key":"2026032711582305700_ref003","article-title":"Total recall: System support for automated availability management","volume-title":"USENIX Symposium on Networked Systems Design and Implementation (NSDI)","author":"Bhagwan","year":"2004"},{"key":"2026032711582305700_ref004","volume-title":"Algebraic Codes for Data Transmission. Cambridge","author":"Blahut"},{"key":"2026032711582305700_ref005","doi-asserted-by":"crossref","DOI":"10.1145\/2349896.2349898","article-title":"Redundantly grouped cross-object coding for repairable storage","volume-title":"APSys","author":"Datta","year":"2012"},{"issue":"1","key":"2026032711582305700_ref006","doi-asserted-by":"crossref","DOI":"10.1145\/2447712.2447735","article-title":"An overview of codes tailor-made for better repairability in networked distributed storage systems","volume":"44","author":"Datta","year":"2013","journal-title":"SIGACT News"},{"key":"2026032711582305700_ref007","article-title":"On data insertion and migration in erasure-coding based large-scaled storage systems","volume-title":"to appear in ICDCIT 2013","author":"Datta"},{"issue":"9","key":"2026032711582305700_ref008","doi-asserted-by":"crossref","DOI":"10.1109\/TIT.2010.2054295","article-title":"Network coding for distributed storage systems","volume":"56","author":"Dimakis","year":"2010","journal-title":"IEEE Transactions on Information Theory"},{"issue":"3","key":"2026032711582305700_ref009","doi-asserted-by":"crossref","DOI":"10.1109\/JPROC.2010.2096170","article-title":"A survey on network codes for distributed storage","volume":"99","author":"Dimakis","year":"2011","journal-title":"The Proceedings of the IEEE"},{"key":"2026032711582305700_ref010","doi-asserted-by":"crossref","DOI":"10.1109\/P2P.2008.9","article-title":"Hierarchical codes: How to make erasure codes attractive for peer-to-peer storage systems","volume-title":"Eighth International Conference on In Peer-to-Peer Computing, P2P","author":"Duminuco","year":"2008"},{"issue":"4","key":"2026032711582305700_ref011","article-title":"Error-free coding","volume":"4","author":"Elias","year":"1954","journal-title":"Transactions on Information Theory"},{"key":"2026032711582305700_ref012","unstructured":"K. S.\n              Esmaili\n            , L.Pamies-Juarez, and A.Datta, \u201cThe CORE storage primitive: Cross-object redundancy for efficient data repair & access in erasure coded storage,\u201d preprint, available at http:\/\/arxiv.org\/abs\/1302.5192."},{"key":"2026032711582305700_ref013","article-title":"On the locality of codewords symbols","volume":"18","author":"Gopalan","year":"2011","journal-title":"Electronic Colloquium on Computational Complexity (ECCC)"},{"key":"2026032711582305700_ref014","unstructured":"hadoop.apache.org\/."},{"key":"2026032711582305700_ref015","unstructured":"H. D. L.\n              Hollmann\n            \n          , \u201cStorage codes \u2014 coding rate and repair locality,\u201d International Conference on Computing, Networking and Communications, available at http:\/\/arxiv.org\/abs\/1301.4300 (ICNC2013)."},{"key":"2026032711582305700_ref016","unstructured":"http:\/\/wiki.apache.org\/hadoop\/HDFS-RAID."},{"issue":"2","key":"2026032711582305700_ref017","doi-asserted-by":"crossref","DOI":"10.1109\/JSAC.2010.100216","article-title":"Cooperative recovery of distributed storage systems from multiple losses with network coding","volume":"28","author":"Hu","year":"2010","journal-title":"IEEE Journal on Selected Areas in Communications"},{"key":"2026032711582305700_ref018","doi-asserted-by":"crossref","DOI":"10.1109\/NCA.2007.37","article-title":"Pyramid codes: Flexible schemes to trade space for access efficiency in reliable data storage systems","volume-title":"IEEE International Symposium on Network Computing and Applications, NCA 2007","author":"Huang","year":"2007"},{"key":"2026032711582305700_ref019","article-title":"Erasure coding in windows azure storage","author":"Huang"},{"key":"2026032711582305700_ref020","unstructured":"Y. H. K. W.\n              Shum\n            \n          , \u201cCooperative regenerating codes,\u201d preprint, available at http:\/\/arxiv.org\/abs\/1101.5257."},{"key":"2026032711582305700_ref021","doi-asserted-by":"crossref","DOI":"10.1109\/ISNETCOD.2011.5978920","article-title":"Repairing multiple failures with coordinated and adaptive regenerating codes","author":"Kermarrec","year":"2011"},{"key":"2026032711582305700_ref022","article-title":"An algebraic approach to network coding","volume":"11","author":"Koetter","year":"2001","journal-title":"IEEE\/ACM Transactions on Networking"},{"issue":"7","key":"2026032711582305700_ref023","doi-asserted-by":"crossref","first-page":"4733","DOI":"10.1109\/TIT.2012.2191135","article-title":"Distributed storage allocations","volume":"58","author":"Leong","year":"2012","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032711582305700_ref024","doi-asserted-by":"crossref","DOI":"10.1109\/PTP.2004.1334935","article-title":"Erasure code replication revisited","volume-title":"P2P","author":"Lin","year":"2004"},{"key":"2026032711582305700_ref025","unstructured":"F.\n              Oggier\n             and A.Datta, \u201cHomomorphic self-repairing codes for agile maintenance of distributed storage systems,\u201d http:\/\/arxiv.org\/abs\/1107.3129."},{"key":"2026032711582305700_ref026","doi-asserted-by":"crossref","DOI":"10.1109\/P2P.2011.6038668","article-title":"Byzantine fault tolerance of regenerating codes","volume-title":"P2P","author":"Oggier","year":"2011"},{"key":"2026032711582305700_ref027","doi-asserted-by":"crossref","DOI":"10.1109\/ITW.2011.6089443","article-title":"Self-repairing codes for distributed storage \u2014 a projective geometric construction","volume-title":"ITW","author":"Oggier","year":"2011"},{"key":"2026032711582305700_ref028","doi-asserted-by":"crossref","DOI":"10.1109\/INFCOM.2011.5934901","article-title":"Self-repairing homomorphic codes for distributed storage systems","volume-title":"INFOCOM","author":"Oggier","year":"2011"},{"key":"2026032711582305700_ref029","unstructured":"L.\n              Pamies-Juarez\n            , A.Datta, and F.Oggier, \u201cRapidRAID: Pipelined erasure codes for fast data archival in distributed storage systems,\u201d http:\/\/arxiv.org\/abs\/1207.6744."},{"key":"2026032711582305700_ref030","unstructured":"L.\n              Pamies-Juarez\n            , F.Oggier, and A.Datta, \u201cAn empirical study of the repair performance of novel coding schemes for networked distributed storage systems,\u201d http:\/\/arxiv.org\/abs\/1206.2187."},{"key":"2026032711582305700_ref031","doi-asserted-by":"crossref","unstructured":"D. S.\n              Papailiopoulos\n             and A. G.Dimakis, \u201cLocally repairable codes,\u201d IEEE International Symposium on Information Theory (ISIT), Available at http:\/\/arxiv.org\/abs\/1206.3804, 2012.","DOI":"10.1109\/ISIT.2012.6284027"},{"key":"2026032711582305700_ref032","doi-asserted-by":"crossref","DOI":"10.1145\/50202.50214","article-title":"A case for redundant arrays of inexpensive disks (RAID)","volume-title":"ACM SIGMOD International Conference on Management of Data","author":"Patterson","year":"1988"},{"issue":"9","key":"2026032711582305700_ref033","article-title":"Securing dynamic distributed storage systems against eavesdropping and adversarial attacks","volume":"57","author":"Pawar","year":"2011","journal-title":"IEEE Transactions on Information Theory (Special Issue on Facets of Coding Theory: from Algorithms to Networks)"},{"key":"2026032711582305700_ref034","doi-asserted-by":"crossref","DOI":"10.1109\/ALLERTON.2009.5394538","article-title":"Explicit construction of optimal exact regenerating codes for distributed storage","volume-title":"Allerton","author":"Rashmi","year":"2009"},{"key":"2026032711582305700_ref035","doi-asserted-by":"crossref","DOI":"10.1109\/ITW.2012.6404723","article-title":"On locality in distributed storage systems","volume-title":"ITW","author":"Rawat","year":"2012"},{"key":"2026032711582305700_ref036","doi-asserted-by":"crossref","DOI":"10.1137\/0108018","article-title":"Polynomial codes over certain finite fields","volume-title":"Journal of the Society of Industrial and Applied Mathematics","author":"Reed","year":"1960"},{"key":"2026032711582305700_ref037","doi-asserted-by":"crossref","unstructured":"K. W.\n              Shum\n            \n          , \u201cCooperative regenerating codes for distributed storage systems,\u201d ICC, available at http:\/\/arxiv.org\/abs\/1101.5257, 2011.","DOI":"10.1109\/icc.2011.5962548"},{"key":"2026032711582305700_ref038","article-title":"Iris: A scalable cloud file system with efficient integrity checks","volume-title":"Cryptology ePrint Archive, Report 2011\/585","author":"Stefanov","year":"2011"},{"key":"2026032711582305700_ref039","doi-asserted-by":"crossref","DOI":"10.1109\/ISIT.2013.6620462","article-title":"Rate region of the (4, 3, 3) exact-repair regenerating codes","volume-title":"preprint","author":"Tian"},{"key":"2026032711582305700_ref040","doi-asserted-by":"crossref","DOI":"10.1109\/ISIT.2009.5205898","article-title":"Reducing repair traffic for erasure coding-based storage via interference alignment","volume-title":"ISIT","author":"Wu","year":"2009"},{"key":"2026032711582305700_ref041","unstructured":"www.cleversafe.com."},{"key":"2026032711582305700_ref042","unstructured":"www.wuala.com\/."},{"key":"2026032711582305700_ref043","article-title":"Network coding theory: Single sources","volume":"2","author":"Yeung","year":"4","journal-title":"Foundations and Trends in Communication and Information Theory"}],"container-title":["Foundations and Trends\u00ae in Communications and Information Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.emerald.com\/ftcit\/article-pdf\/9\/4\/383\/10977068\/0100000068en.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/www.emerald.com\/ftcit\/article-pdf\/9\/4\/383\/10977068\/0100000068en.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T14:10:46Z","timestamp":1777471846000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.emerald.com\/ftcit\/article\/9\/4\/383\/1324922\/Coding-Techniques-for-Repairability-in-Networked"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,6,6]]},"references-count":43,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2013,6,6]]}},"URL":"https:\/\/doi.org\/10.1561\/0100000068","relation":{},"ISSN":["1567-2190","1567-2328"],"issn-type":[{"value":"1567-2190","type":"print"},{"value":"1567-2328","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,6,6]]}}}