{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T22:15:40Z","timestamp":1775081740819,"version":"3.50.1"},"reference-count":38,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T00:00:00Z","timestamp":1656201600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T00:00:00Z","timestamp":1656201600000},"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":[[2022,6,26]]},"DOI":"10.1109\/isit50566.2022.9834830","type":"proceedings-article","created":{"date-parts":[[2022,8,3]],"date-time":"2022-08-03T15:34:22Z","timestamp":1659540862000},"page":"2607-2612","source":"Crossref","is-referenced-by-count":17,"title":["Practical Considerations in Repairing Reed-Solomon Codes"],"prefix":"10.1109","author":[{"given":"Thi Xinh","family":"Dinh","sequence":"first","affiliation":[{"name":"RMIT University"}]},{"given":"Luu Y","family":"Nhi Nguyen","sequence":"additional","affiliation":[{"name":"RMIT University"}]},{"given":"Lakshmi J.","family":"Mohan","sequence":"additional","affiliation":[{"name":"RMIT University"}]},{"given":"Serdar","family":"Boztas","sequence":"additional","affiliation":[{"name":"RMIT University"}]},{"given":"Tran Thi","family":"Luong","sequence":"additional","affiliation":[{"name":"Academy of Cryptographic Technique,Hanoi,Vietnam"}]},{"given":"Son Hoang","family":"Dau","sequence":"additional","affiliation":[{"name":"RMIT University"}]}],"member":"263","reference":[{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/2901318.2901328"},{"key":"ref33","article-title":"Frank Luebeck&#x2019;s list of Conway polynomials","year":"0"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1985.1057113"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.14778\/2536222.2536234"},{"key":"ref30","article-title":"Quantcast File System&#x2019;s Reed-Solomon code","year":"0"},{"key":"ref37","article-title":"Records of the current-best repair bandwidths found for short-length Reed-Solomon codes","year":"0"},{"key":"ref36","first-page":"383","article-title":"f4: Facebook&#x2019;s warm BLOB storage system","author":"muralidhar","year":"2014","journal-title":"Proc 11th ACM\/USENIX Symp Oper Syst Des Implementation (OSDI)"},{"key":"ref35","article-title":"Backblaze Vaults&#x2019; Reed-Solomon codes source codes","year":"0"},{"key":"ref34","article-title":"Backblaze Vaults&#x2019; Reed-Solomon codes","year":"0"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ITA.2017.8023449"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2017.8262839"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2917425"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2017.28"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2884075"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9517961"},{"key":"ref16","article-title":"Nonlinear repair schemes of Reed-Solomon codes","author":"con","year":"2021"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006548"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2827942"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2017.8262866"},{"key":"ref28","author":"macwilliams","year":"1977","journal-title":"The Theory of Error-Correcting Codes"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2702660"},{"key":"ref27","article-title":"An implementation of trace repair for Reed-Solomon codes on top of ISA-L","year":"0"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897525"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2661313"},{"key":"ref29","article-title":"Intel(R) Intelligent Storage Acceleration Library (ISA-L)&#x2019;s Reed-Solomon codes","year":"0"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541489"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3071447"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2017.8262840"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2014.140519"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1137\/0108018"},{"key":"ref9","first-page":"346","article-title":"Optimal repair schemes for some families of Reed-Solomon codes","author":"dau","year":"2017","journal-title":"Proc IEEE Int Symp Inform Theory (ISIT)"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2876542"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3071878"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ISCIT.2019.8905159"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437865"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2019.2950922"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849700"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2018.8613326"}],"event":{"name":"2022 IEEE International Symposium on Information Theory (ISIT)","location":"Espoo, Finland","start":{"date-parts":[[2022,6,26]]},"end":{"date-parts":[[2022,7,1]]}},"container-title":["2022 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9834325\/9834269\/09834830.pdf?arnumber=9834830","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:36:02Z","timestamp":1773347762000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9834830\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,26]]},"references-count":38,"URL":"https:\/\/doi.org\/10.1109\/isit50566.2022.9834830","relation":{},"subject":[],"published":{"date-parts":[[2022,6,26]]}}}