{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T12:59:52Z","timestamp":1772283592612,"version":"3.50.1"},"reference-count":34,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"7","license":[{"start":{"date-parts":[[2013,7,1]],"date-time":"2013-07-01T00:00:00Z","timestamp":1372636800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2013,7]]},"DOI":"10.1109\/tit.2013.2252395","type":"journal-article","created":{"date-parts":[[2013,3,12]],"date-time":"2013-03-12T18:24:09Z","timestamp":1363112649000},"page":"4510-4519","source":"Crossref","is-referenced-by-count":123,"title":["Partial-MDS Codes and Their Application to RAID Type of Architectures"],"prefix":"10.1109","volume":"59","author":[{"given":"M.","family":"Blaum","sequence":"first","affiliation":[]},{"given":"J. L.","family":"Hafner","sequence":"additional","affiliation":[]},{"given":"S.","family":"Hetzler","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref33","first-page":"1817","article-title":"Low-density MDS codes and factors of complete graphs","volume":"it 45","author":"xu","year":"1999","journal-title":"IEEE Trans Inf Theory"},{"key":"ref32","author":"wesley peterson","year":"1984","journal-title":"Error-Correcting Codes"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/1629075.1629076"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.261714"},{"key":"ref34","first-page":"272","article-title":"X-code: MDS array codes with optimal encoding","volume":"it 45","author":"xu","year":"1999","journal-title":"IEEE Trans Inf Theory"},{"key":"ref10","first-page":"3","article-title":"Theory of codes with maximum rank distance","volume":"21","author":"gabidulin","year":"1985","journal-title":"Prob Inf Transmiss"},{"key":"ref11","author":"gibson","year":"1992","journal-title":"Redundant Disk Arrays"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2208937"},{"key":"ref13","article-title":"Building flexible, fault-tolerant flash-based storage systems","author":"greenan","year":"2009","journal-title":"Workshop on Hot Topics in Dependability"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557599"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/20.917615"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/NCA.2007.37"},{"key":"ref17","article-title":"Erasure coding in Windows Azure storage","author":"huang","year":"2012","journal-title":"USENIX Annu Tech Conf"},{"key":"ref18","author":"hutsell","year":"0","journal-title":"An in-depth look at the RamSan-500 cached flash solid state disk"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2010.197"},{"key":"ref4","author":"blaum","year":"2012","journal-title":"?Partial-MDS codes and their application to RAID type of architectures ?"},{"key":"ref28","article-title":"SD codes: Erasure codes designed for how storage systems really fail","author":"plank","year":"2013","journal-title":"13th Conf File Storage Technol"},{"key":"ref3","author":"blaum","year":"1998","journal-title":"Handbook of Coding Theory"},{"key":"ref27","first-page":"97","article-title":"The RAID-6 liberation codes","author":"plank","year":"2008","journal-title":"Proc 6th USENIX Conf File Storage Technol"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/18.179343"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1985.1057098"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/18.75248"},{"key":"ref8","article-title":"Row-diagonal parity for double disk failure correction","author":"corbett","year":"2004","journal-title":"Proc 3rd Conf File Storage Technol"},{"key":"ref7","first-page":"218","article-title":"Coding of generalized concatenated codes","volume":"10","author":"blokh","year":"1974","journal-title":"Problemy Peredachii Inf"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/12.364531"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(78)90015-8"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/1807060.1807061"},{"key":"ref20","article-title":"A new class of array codes for memory storage","author":"lastras-monta\ufffdo","year":"2011","journal-title":"Inf Theory Appl Workshop"},{"key":"ref22","author":"lin","year":"2004","journal-title":"Error Control Coding"},{"key":"ref21","author":"li","year":"2011","journal-title":"?C-Codes Cyclic lowest-density MDS array codes constructed using starters for RAID 6 ?"},{"key":"ref24","year":"0","journal-title":"N-29?17 NAND flash design and use considerations introduction"},{"key":"ref23","author":"macwilliams","year":"1977","journal-title":"The Theory of Error-Correcting Codes"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-024X(199709)27:9<995::AID-SPE111>3.3.CO;2-Y"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ISCIT.2009.5341269"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/6530620\/06478813.pdf?arnumber=6478813","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,23]],"date-time":"2021-12-23T07:46:27Z","timestamp":1640245587000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6478813\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,7]]},"references-count":34,"journal-issue":{"issue":"7"},"URL":"https:\/\/doi.org\/10.1109\/tit.2013.2252395","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,7]]}}}