{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T19:39:49Z","timestamp":1787341189490,"version":"build-2736575974"},"reference-count":40,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"9","license":[{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"European Research Council","award":["852953"],"award-info":[{"award-number":["852953"]}]},{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"crossref","award":["2369\/24"],"award-info":[{"award-number":["2369\/24"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2026,9]]},"DOI":"10.1109\/tit.2026.3708323","type":"journal-article","created":{"date-parts":[[2026,6,29]],"date-time":"2026-06-29T19:39:35Z","timestamp":1782761975000},"page":"6478-6492","source":"Crossref","is-referenced-by-count":0,"title":["New Bounds and Constructions for Variable Packet-Error Coding"],"prefix":"10.1109","volume":"72","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7893-2276","authenticated-orcid":false,"given":"Xiangliang","family":"Kong","sequence":"first","affiliation":[{"name":"Tel Aviv University","place":["Tel Aviv-Yafo, Israel"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6364-8275","authenticated-orcid":false,"given":"Xin","family":"Wang","sequence":"additional","affiliation":[{"name":"Soochow University","place":["Suzhou, Jiangsu, China"],"department":["Department of Mathematics"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4168-9505","authenticated-orcid":false,"given":"Ron M.","family":"Roth","sequence":"additional","affiliation":[{"name":"Technion","place":["Haifa, Israel"],"department":["Computer Science Department"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8000-0419","authenticated-orcid":false,"given":"Itzhak","family":"Tamo","sequence":"additional","affiliation":[{"name":"Tel Aviv University","place":["Tel Aviv-Yafo, Israel"]}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/18.850663"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2002.1115432"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.4310\/CIS.2006.v6.n1.a2"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.4310\/cis.2006.v6.n1.a3"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2013.2294254"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/SURV.2013.013013.00104"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2725280"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2761122"},{"key":"ref9","first-page":"345","article-title":"Cluster storage systems gotta have heart: Improving storage efficiency by exploiting disk-reliability heterogeneity","volume-title":"Proc. 17th USENIX Conf. File Storage Technol. (FAST)","author":"Kadekodi"},{"key":"ref10","first-page":"369","article-title":"PACEMAKER: Avoiding HeART attacks in storage clusters with disk-adaptive redundancy","volume-title":"Proc. 14th USENIX Symp. Operating Syst. Design Implement. (OSDI)","author":"Kadekodi"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3155972"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/MBITS.2024.3352542"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/79.952806"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1982.1056588"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2177749"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1017\/cbo9780511721656"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2011.6089503"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3194521"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3187366"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1002\/047174882X.ch10"},{"key":"ref21","article-title":"List decoding for noisy channels","author":"Elias","year":"1957"},{"key":"ref22","first-page":"90","article-title":"List decoding","volume-title":"Quart. Prog. Rep.","volume":"48","author":"Wozencraft","year":"1958"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1017\/s0021900200096017"},{"issue":"1","key":"ref24","first-page":"11","article-title":"Bounds for codes in decoding by a list of finite length","volume":"22","author":"Blinovski\u0131","year":"1986","journal-title":"Problemy Peredachi Informatsii"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-6193-4"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/18.61123"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-49116-3_8"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/1538902.1538904"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1999.1653"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/301250.301397"},{"key":"ref31","volume-title":"Essential Coding Theory","author":"Guruswami","year":"2019"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1006\/aama.1998.0588"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511807077"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511808968"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1137\/090778274"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/3564246.3585128"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2024.3449030"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2024.3402171"},{"key":"ref39","article-title":"Explicit folded Reed\u2013Solomon and multiplicity codes achieve relaxed generalized singleton bounds","author":"Chen","year":"2024","journal-title":"arXiv:2408.15925"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-011-3488-0_5"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/18\/11661563\/11586107.pdf?arnumber=11586107","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T19:09:03Z","timestamp":1787339343000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11586107\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,9]]},"references-count":40,"journal-issue":{"issue":"9"},"URL":"https:\/\/doi.org\/10.1109\/tit.2026.3708323","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,9]]}}}