{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T16:51:56Z","timestamp":1769273516256,"version":"3.49.0"},"reference-count":36,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"9","license":[{"start":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T00:00:00Z","timestamp":1567296000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T00:00:00Z","timestamp":1567296000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T00:00:00Z","timestamp":1567296000000},"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":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2019,9]]},"DOI":"10.1109\/tit.2019.2917425","type":"journal-article","created":{"date-parts":[[2019,5,17]],"date-time":"2019-05-17T20:17:32Z","timestamp":1558124252000},"page":"5484-5502","source":"Crossref","is-referenced-by-count":26,"title":["On the Sub-Packetization Size and the Repair Bandwidth of Reed-Solomon Codes"],"prefix":"10.1109","volume":"65","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1218-0478","authenticated-orcid":false,"given":"Weiqi","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3339-3085","authenticated-orcid":false,"given":"Zhiying","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6838-8038","authenticated-orcid":false,"given":"Hamid","family":"Jafarkhani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.14778\/2535573.2488339"},{"key":"ref32","author":"chowdhury","year":"2017","journal-title":"Improved schemes for asymptotically optimal repair of mds codes"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TBDATA.2017.2749255"},{"key":"ref30","author":"li","year":"2019","journal-title":"A systematic construction of MDS codes with small sub-packetization level and near optimal repair bandwidth"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139172769"},{"key":"ref35","author":"goss","year":"2012","journal-title":"Basic Structures of Function Field Arithmetic"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2237752"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2241819"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2227110"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2553675"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ITA.2016.7888191"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2690662"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2730863"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541489"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2017.28"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2827942"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2876542"},{"key":"ref28","first-page":"2109","article-title":"MDS code constructions with small sub-packetization and near-optimal repair bandwidth","author":"guruswami","year":"2017","journal-title":"Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1998.743426"},{"key":"ref27","first-page":"253","article-title":"A performance evaluation and examination of open-source erasure coding libraries for storage","volume":"9","author":"plank","year":"2009","journal-title":"Proc FAST"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511803253"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2702660"},{"key":"ref29","first-page":"20","article-title":"Rethinking erasure codes for cloud file systems: Minimizing I\/O for recovery and degraded reads","author":"khan","year":"2012","journal-title":"Proc FAST"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2014.140519"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2054295"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006547"},{"key":"ref2","author":"macwilliams","year":"1977","journal-title":"The Theory of Error Correcting Codes"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2159049"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2017.8262839"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2898660"},{"key":"ref22","author":"ye","year":"2017","journal-title":"Repairing Reed–Solomon codes Universally achieving the cut-set bound for any number of erasures"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437474"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/MASCOT.2008.4770564"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/s10958-013-1350-5"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/2093139.2093141"},{"key":"ref25","first-page":"299","article-title":"Screaming fast Galois field arithmetic using intel SIMD instructions","author":"plank","year":"2013","journal-title":"Proc FAST"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/8804391\/08717612.pdf?arnumber=8717612","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T20:52:06Z","timestamp":1657745526000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8717612\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9]]},"references-count":36,"journal-issue":{"issue":"9"},"URL":"https:\/\/doi.org\/10.1109\/tit.2019.2917425","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,9]]}}}