{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:32:04Z","timestamp":1750221124122,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":21,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,12,8]],"date-time":"2018-12-08T00:00:00Z","timestamp":1544227200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,12,8]]},"DOI":"10.1145\/3297156.3297266","type":"proceedings-article","created":{"date-parts":[[2019,2,28]],"date-time":"2019-02-28T13:07:04Z","timestamp":1551359224000},"page":"536-541","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Comparison on Binary MDS Array Codes for Single Disk Failure Recovery"],"prefix":"10.1145","author":[{"given":"Junrong","family":"Ze","sequence":"first","affiliation":[{"name":"School of Information Engineering, Shenzhen University, Shenzhen, China, School of Electrical Engineering, & Intelligentization, Dongguan University of Technology, Dongguan, China"}]},{"given":"Hanxu","family":"Hou","sequence":"additional","affiliation":[{"name":"School of Electrical Engineering, & Intelligentization, Dongguan University of Technology, Dongguan, China"}]},{"given":"Yunghsiang S.","family":"Han","sequence":"additional","affiliation":[{"name":"School of Electrical Engineering, & Intelligentization, Dongguan University of Technology, Dongguan, China"}]}],"member":"320","published-online":{"date-parts":[[2018,12,8]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/0108018"},{"key":"e_1_3_2_1_2_1","volume-title":"Tech.Rep. TR-95-048","author":"Blomer J.","year":"1995","unstructured":"J. Blomer , M. Kalfane , R. Karp , M. Karpinski , M. Luby , and D. Zuckerman , \" An xor-based erasure-resilient coding scheme ,\" Tech.Rep. TR-95-048 , International Computer Science Institute , August 1995 . J. Blomer, M. Kalfane, R. Karp, M. Karpinski, M. Luby, and D. Zuckerman, \"An xor-based erasure-resilient coding scheme,\" Tech.Rep. TR-95-048, International Computer Science Institute, August 1995."},{"key":"e_1_3_2_1_3_1","first-page":"1","volume-title":"Row-diagonal parity for double disk failure correction,\" in Proc. of USENIX FAST","author":"Corbett P.","year":"2004","unstructured":"P. Corbett , B. English , A. Goel , T. Grcanac , S. Kleiman , J. Leong , and S. Sankar , \" Row-diagonal parity for double disk failure correction,\" in Proc. of USENIX FAST , pp. 1 -- 14 , 2004 . P. Corbett, B. English, A. Goel, T. Grcanac, S. Kleiman, J. Leong, and S. Sankar, \"Row-diagonal parity for double disk failure correction,\" in Proc. of USENIX FAST, pp. 1--14, 2004."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/12.364531"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.746809"},{"key":"e_1_3_2_1_6_1","volume-title":"Star: An efficient coding scheme for correcting triple storage node failures,\" inProc. of USENIX FAST","author":"Huang C.","year":"2005","unstructured":"C. Huang and L. Xu , \" Star: An efficient coding scheme for correcting triple storage node failures,\" inProc. of USENIX FAST , 2005 . C. Huang and L. Xu, \"Star: An efficient coding scheme for correcting triple storage node failures,\" inProc. of USENIX FAST, 2005."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.485722"},{"issue":"99","key":"e_1_3_2_1_8_1","first-page":"1","article-title":"A new construction and an efficient decoding method for Rabin-Like codes","author":"Hou H.","year":"2017","unstructured":"H. Hou and Y. S. Han , \" A new construction and an efficient decoding method for Rabin-Like codes ,\" IEEE Transactions on Communications , no. 99 , pp. 1 -- 12 , October 2017 . H. Hou and Y. S. Han, \"A new construction and an efficient decoding method for Rabin-Like codes,\" IEEE Transactions on Communications, no. 99, pp. 1--12, October 2017.","journal-title":"IEEE Transactions on Communications"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2005.200"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2054295"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2027066.2027071"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2027066.2027071"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/NAS.2010.64"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/NAS.2011.36"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2013.8"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2014.140520"},{"issue":"7","key":"e_1_3_2_1_17_1","first-page":"1293","article-title":"Two new classes of two-parity MDS array codes with optimal repair","volume":"20","author":"Wang Y.","year":"2016","unstructured":"Y. Wang , X. Yin , and X. Wang , \" Two new classes of two-parity MDS array codes with optimal repair ,\" IEEE Communications Letters , vol. 20 , no. 7 , pp. 1293 -- 1296 , 2016 . Y. Wang, X. Yin, and X. Wang, \"Two new classes of two-parity MDS array codes with optimal repair,\" IEEE Communications Letters, vol. 20, no. 7, pp. 1293--1296, 2016.","journal-title":"IEEE Communications Letters"},{"key":"e_1_3_2_1_18_1","first-page":"81","volume-title":"Opening the chrysalis: on the real repair performance of msr codes,\" in 14th USENIX Conference on File and Storage Technologies (FAST 16)","author":"Pamies-Juarez L.","year":"2016","unstructured":"L. Pamies-Juarez , F. Blagojevic , R. Mateescu , C. Gyuot , E. E. Gad , and Z. Bandic , \" Opening the chrysalis: on the real repair performance of msr codes,\" in 14th USENIX Conference on File and Storage Technologies (FAST 16) , pp. 81 -- 94 , 2016 . L. Pamies-Juarez, F. Blagojevic, R. Mateescu, C. Gyuot, E. E. Gad, and Z. Bandic, \"Opening the chrysalis: on the real repair performance of msr codes,\" in 14th USENIX Conference on File and Storage Technologies (FAST 16), pp. 81--94, 2016."},{"issue":"6","key":"e_1_3_2_1_19_1","first-page":"839","article-title":"Triple-fault-tolerant binary MDS array codes with asymptotically optimal repair","volume":"45","author":"Hou H.","year":"2017","unstructured":"H. Hou , P. P. Lee , Y. S. Han , and Y. Hu , \" Triple-fault-tolerant binary MDS array codes with asymptotically optimal repair ,\" IEEE International Symposium on Information Theory , vol. 45 , no. 6 , pp. 839 -- 843 , 2017 . H. Hou, P. P. Lee, Y. S.Han, and Y. Hu, \"Triple-fault-tolerant binary MDS array codes with asymptotically optimal repair,\" IEEE International Symposium on Information Theory, vol. 45, no. 6, pp. 839--843, 2017.","journal-title":"IEEE International Symposium on Information Theory"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1653662.1653686"},{"key":"e_1_3_2_1_22_1","unstructured":"J. S. Plank J. Luo C. D. Schuman L. Xu and Z. W. O'Hearn \"A performance evaluation and examination of open-source erasure coding libraries for storage \" In USENIX FAST 2009.   J. S. Plank J. Luo C. D. Schuman L. Xu and Z. W. O'Hearn \"A performance evaluation and examination of open-source erasure coding libraries for storage \" In USENIX FAST 2009."}],"event":{"name":"CSAI '18: 2018 2nd International Conference on Computer Science and Artificial Intelligence","sponsor":["Shenzhen University Shenzhen University"],"location":"Shenzhen China","acronym":"CSAI '18"},"container-title":["Proceedings of the 2018 2nd International Conference on Computer Science and Artificial Intelligence"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3297156.3297266","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3297156.3297266","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:02:14Z","timestamp":1750208534000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3297156.3297266"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,12,8]]},"references-count":21,"alternative-id":["10.1145\/3297156.3297266","10.1145\/3297156"],"URL":"https:\/\/doi.org\/10.1145\/3297156.3297266","relation":{},"subject":[],"published":{"date-parts":[[2018,12,8]]},"assertion":[{"value":"2018-12-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}