{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T12:50:29Z","timestamp":1768567829591,"version":"3.49.0"},"reference-count":41,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,12,14]],"date-time":"2025-12-14T00:00:00Z","timestamp":1765670400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,12,14]],"date-time":"2025-12-14T00:00:00Z","timestamp":1765670400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,12,14]]},"DOI":"10.1109\/icpads67057.2025.11322993","type":"proceedings-article","created":{"date-parts":[[2026,1,14]],"date-time":"2026-01-14T20:36:54Z","timestamp":1768423014000},"page":"1-10","source":"Crossref","is-referenced-by-count":0,"title":["BRGCs: A New Class of Horizontal Code with Excellent Scalability and High Computational Efficiency"],"prefix":"10.1109","author":[{"given":"Ziwen","family":"Wei","sequence":"first","affiliation":[{"name":"Chengdu Institute of Computer Applications,Chinese Academy of Sciences,Chengdu,China"}]},{"given":"Yidong","family":"Wang","sequence":"additional","affiliation":[{"name":"Chengdu Institute of Computer Applications,Chinese Academy of Sciences,Chengdu,China"}]},{"given":"Meijuan","family":"Li","sequence":"additional","affiliation":[{"name":"Chengdu Institute of Computer Applications,Chinese Academy of Sciences,Chengdu,China"}]},{"given":"Xiaolin","family":"Qin","sequence":"additional","affiliation":[{"name":"Chengdu Institute of Computer Applications,Chinese Academy of Sciences,Chengdu,China"}]},{"given":"Dan","family":"Tang","sequence":"additional","affiliation":[{"name":"Chengdu University of Information Technology,Chengdu,China"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/945445.945450"},{"issue":"1","key":"ref2","first-page":"553","article-title":"Comparative analysis of google file system and hadoop distributed file system","volume":"3","author":"Vijayakumari","year":"2014","journal-title":"International Journal of Advanced Trends in Computer Science and Engineering"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/1594204.1594206"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/2043556.2043571"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/384264.379239"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/MSST.2010.5496972"},{"key":"ref7","first-page":"307","article-title":"Ceph: A scalable, high-performance distributed file system","volume-title":"Proceedings of the 7th Conference on Operating Systems Design and Implementation (OSDI\u201906)","author":"Weil","year":"2006"},{"key":"ref8","author":"Weil","year":"2007","journal-title":"Ceph: reliable, scalable, and high-performance distributed storage"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/50202.50214"},{"key":"ref10","first-page":"1855","article-title":"Array codes","volume":"2","author":"Blaum","year":"1998","journal-title":"Handbook of coding theory"},{"key":"ref11","article-title":"The theory of error-correcting codes","volume":"16","author":"MacWilliams","year":"1977","journal-title":"Elsevier"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/12.364531"},{"key":"ref13","first-page":"1","article-title":"Row-diagonal parity for double disk failure correction","volume-title":"Proceedings of the 3rd USENIX Conference on File and Storage Technologies","author":"Corbett","year":"2004"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1177\/1094342009106191"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS47924.2020.00078"},{"key":"ref16","article-title":"The raid-6 liberation codes","volume-title":"6th USENIX Conference on File and Storage Technologies, FAST 2008","author":"Plank"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2007.70830"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/2421648.2421655"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ISPA-BDCloud-SocialCom-SustainCom52081.2021.00132"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-021-04271-9"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/18.746809"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/18.782102"},{"issue":"3","key":"ref23","first-page":"29","article-title":"Minimum-check-density codes for correcting bytes of errors, erasures, or defects","volume":"19","author":"Zaitsev","year":"1983","journal-title":"Problemy Peredachi Informatsii"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/1542275.1542326"},{"key":"ref25","first-page":"211","article-title":"Weaver codes: Highly fault tolerant erasure codes for storage systems.","volume":"5","author":"Hafner","year":"2005","journal-title":"Fast"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/3337821.3337829"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2011.78"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2013.8"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/Redundancy59964.2023.10330179"},{"issue":"9","key":"ref30","first-page":"2766","article-title":"Double fault tolerant array code with low compilation complexity","volume":"43","author":"Xie","year":"2023","journal-title":"Journal of Computer Applications"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/s11741-011-0720-2"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/18.179343"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/18.746771"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/1970338.1970340"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/NCA.2008.29"},{"key":"ref36","article-title":"Optimizing cauchy reed-solomon codes for fault-tolerant storage applications","volume":"38","author":"Plank","year":"2005","journal-title":"University of Tennessee, Tech. Rep. CS-05\u2013569"},{"key":"ref37","article-title":"Inverse code: A low-density mds horizontal array code tolerating triple faults","author":"Liang","year":"2017","journal-title":"Advanced Engineering Sciences"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1063\/1.4977391"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1137\/0108018"},{"key":"ref40","article-title":"An xor-based erasure-resilient coding scheme","author":"Blomer","year":"1995","journal-title":"Technical report at ICSI"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1145\/1416944.1416949"}],"event":{"name":"2025 IEEE 31th International Conference on Parallel and Distributed Systems (ICPADS)","location":"Hefei, China","start":{"date-parts":[[2025,12,14]]},"end":{"date-parts":[[2025,12,18]]}},"container-title":["2025 IEEE 31th International Conference on Parallel and Distributed Systems (ICPADS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11322805\/11322871\/11322993.pdf?arnumber=11322993","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T07:09:18Z","timestamp":1768460958000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11322993\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,14]]},"references-count":41,"URL":"https:\/\/doi.org\/10.1109\/icpads67057.2025.11322993","relation":{},"subject":[],"published":{"date-parts":[[2025,12,14]]}}}