{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T09:58:21Z","timestamp":1740131901511,"version":"3.37.3"},"reference-count":38,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61232003","61327902"],"award-info":[{"award-number":["61232003","61327902"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"State Key Laboratory of High-end Server and Storage Technology","award":["2014HSSA02"],"award-info":[{"award-number":["2014HSSA02"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Comput."],"published-print":{"date-parts":[[2017,1,1]]},"DOI":"10.1109\/tc.2016.2576461","type":"journal-article","created":{"date-parts":[[2016,6,7]],"date-time":"2016-06-07T18:09:23Z","timestamp":1465322963000},"page":"127-137","source":"Crossref","is-referenced-by-count":10,"title":["Short Code: An Efficient RAID-6 MDS Code for Optimizing Degraded Reads and Partial Stripe Writes"],"prefix":"10.1109","volume":"66","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5796-7314","authenticated-orcid":false,"given":"Yingxun","family":"Fu","sequence":"first","affiliation":[]},{"given":"Jiwu","family":"Shu","sequence":"additional","affiliation":[]},{"given":"Xianghong","family":"Luo","sequence":"additional","affiliation":[]},{"given":"Zhirong","family":"Shen","sequence":"additional","affiliation":[]},{"given":"Qingda","family":"Hu","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/NAS.2014.29"},{"key":"ref33","first-page":"95","article-title":"SD codes:\n Erasure codes designed for how storage systems really fail","author":"plank","year":"0","journal-title":"Proc 11th USENIX Conf File Storage Technol"},{"key":"ref32","first-page":"253","article-title":"A performance evaluation and examination of open-source erasure\n coding libraries for storage","author":"plank","year":"0","journal-title":"Proc USENIX Conf File Storage Technol"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2227110"},{"key":"ref30","first-page":"21","article-title":"NCCloud: Applying network coding for the storage repair\n in a cloud-of-clouds","author":"hu","year":"0","journal-title":"Proc 10th USENIX Conf File Storage Technol"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/1542275.1542326"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/ICPP.2013.69"},{"key":"ref35","article-title":"C-Codes: Cyclic lowest-density MDS array codes constructed using starters for RAID 6","author":"li","year":"0","journal-title":"Proc Comput Res Repository"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/2658991"},{"key":"ref10","article-title":"Disk failures in the real world: What does an MTTF of 1,000,000 hours mean to you?","author":"schroeder","year":"0","journal-title":"Proc 5th USENIX Conf File Storage Technol"},{"key":"ref11","first-page":"20","article-title":"Rethinking erasure codes for cloud file\n systems: Minimizing I\/O for recovery and degraded reads","author":"khan","year":"0","journal-title":"Proc 10th USENIX Conf File Storage Technol"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/1811039.1811054"},{"key":"ref13","first-page":"2","article-title":"Erasure coding in Windows Azure storage","author":"huang","year":"0","journal-title":"Proc USENIX Conf Annu Tech Conf"},{"key":"ref14","first-page":"61","article-title":"Availability in globally distributed storage systems","author":"ford","year":"0","journal-title":"Proc 9th USENIX Conf Oper Syst Des Implementation"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2011.78"},{"key":"ref16","first-page":"109","article-title":"A case for\n redunant arrays of inexpensive disks (RAID)","author":"patterson","year":"0","journal-title":"Proc ACM SIGMOD Int Conf Manage Data"},{"key":"ref17","article-title":"The RAID-6 liberation codes","author":"plank","year":"0","journal-title":"Proc 6th USENIX Conf File Storage Technol"},{"article-title":"Jerasure:\n A library in C\/C++ facilitating erasure coding for storage applications-Version 1.2","year":"2008","author":"plank","key":"ref18"},{"article-title":"Performance metrics for erasure codes in\n storage systems","year":"2004","author":"hafner","key":"ref19"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/MSST.2010.5496983"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/DSN.2011.5958220"},{"key":"ref27","first-page":"16","article-title":"WEAVER codes: Highly fault tolerant erasure codes for storage\n systems","author":"hafner","year":"0","journal-title":"4th Usenix Conf on File and Storage Tech"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/378993.379239"},{"journal-title":"The Theory of Error-Correcting Codes","year":"1977","author":"macwilliams","key":"ref6"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/2339118.2339121"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/1713072.1713075"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/18.746771"},{"key":"ref7","first-page":"1","article-title":"Row-Diagonal Parity for double disk failure correction","author":"corbett","year":"0","journal-title":"Proc 3rd USENIX Conf File Storage Technol"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/2043556.2043571"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/18.746809"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/945449.945450"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1137\/0108018"},{"key":"ref22","first-page":"85","article-title":"A new minimun density RAID-6 code with a word size of eight","author":"plank","year":"0","journal-title":"Proc IEEE International Symp Netw Comput Appl"},{"key":"ref21","article-title":"An XOR-based erasure-resilient coding scheme","author":"blomer","year":"1995","journal-title":"Int Comput Sci Inst Berkeley CA USA Tech Rep TR-95-048"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/18.782102"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/18.746771"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/DSN.2006.40"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2013024"}],"container-title":["IEEE Transactions on Computers"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/12\/7779217\/07484694.pdf?arnumber=7484694","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:12:26Z","timestamp":1642003946000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7484694\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,1,1]]},"references-count":38,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tc.2016.2576461","relation":{},"ISSN":["0018-9340"],"issn-type":[{"type":"print","value":"0018-9340"}],"subject":[],"published":{"date-parts":[[2017,1,1]]}}}