{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T22:15:47Z","timestamp":1775081747003,"version":"3.50.1"},"reference-count":23,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,10]]},"DOI":"10.1109\/allerton.2017.8262839","type":"proceedings-article","created":{"date-parts":[[2018,1,18]],"date-time":"2018-01-18T18:03:47Z","timestamp":1516298627000},"page":"942-949","source":"Crossref","is-referenced-by-count":18,"title":["A tradeoff between the sub-packetization size and the repair bandwidth for reed-solomon code"],"prefix":"10.1109","author":[{"given":"Weiqi","family":"Li","sequence":"first","affiliation":[]},{"given":"Zhiying","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Hamid","family":"Jafarkhani","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2159049"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2241819"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2227110"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2553675"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ITA.2016.7888191"},{"key":"ref15","author":"goparaju","year":"2016","journal-title":"Minimum storage regenerating codes for all parameters"},{"key":"ref16","volume":"abs 1605 8630","author":"ye","year":"2016","journal-title":"Explicit constructions of optimal-access MDS codes with nearly optimal sub-packetization"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541489"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2017.28"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2305698"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2014.140519"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1998.743426"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006547"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2702660"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2017.8262866"},{"key":"ref7","author":"dau","year":"2016","journal-title":"Repairing reed-solomon codes with multiple erasures"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511803253"},{"key":"ref1","author":"macwilliams","year":"1977","journal-title":"The Theory of Error-Correcting Codes"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2054295"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2309000"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006888"},{"key":"ref21","author":"huang","year":"2016","journal-title":"Improved upper bounds on systematic-length for linear minimum storage regenerating codes"},{"key":"ref23","author":"goss","year":"2012","journal-title":"Basic Structures of Function Field Arithmetic"}],"event":{"name":"2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","location":"Monticello, IL, USA","start":{"date-parts":[[2017,10,3]]},"end":{"date-parts":[[2017,10,6]]}},"container-title":["2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8253908\/8262705\/08262839.pdf?arnumber=8262839","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,2,28]],"date-time":"2018-02-28T16:37:40Z","timestamp":1519835860000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8262839\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10]]},"references-count":23,"URL":"https:\/\/doi.org\/10.1109\/allerton.2017.8262839","relation":{},"subject":[],"published":{"date-parts":[[2017,10]]}}}