{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:41:26Z","timestamp":1773376886502,"version":"3.50.1"},"reference-count":24,"publisher":"IEEE","license":[{"start":{"date-parts":[[2024,7,7]],"date-time":"2024-07-07T00:00:00Z","timestamp":1720310400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,7,7]],"date-time":"2024-07-07T00:00:00Z","timestamp":1720310400000},"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":[[2024,7,7]]},"DOI":"10.1109\/isit57864.2024.10619440","type":"proceedings-article","created":{"date-parts":[[2024,8,19]],"date-time":"2024-08-19T13:25:01Z","timestamp":1724073901000},"page":"1456-1461","source":"Crossref","is-referenced-by-count":3,"title":["On Low Field Size Constructions of Access-Optimal Convertible Codes"],"prefix":"10.1109","author":[{"given":"Saransh","family":"Chopra","sequence":"first","affiliation":[{"name":"Carnegie Mellon University,Computer Science Department,Pittsburgh,PA,USA"}]},{"given":"Francisco","family":"Maturana","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University,Computer Science Department,Pittsburgh,PA,USA"}]},{"given":"K. V.","family":"Rashmi","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University,Computer Science Department,Pittsburgh,PA,USA"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1006\/jcom.1994.1021"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2004.833807"},{"key":"ref3","first-page":"233","article-title":"Exploiting Combined Locality for Wide-Stripe Erasure Coding in Distributed Storage","volume-title":"19th USENIX Conference on File and Storage Technologies (FAST 21)","author":"Hu","year":"2021"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/3626198"},{"key":"ref5","first-page":"345","article-title":"Cluster storage systems gotta have HeART: improving storage efficiency by exploiting disk-reliability heterogeneity","volume-title":"17th USENIX Conference on File and Storage Technologies, FAST 2019","author":"Kadekodi","year":"2019"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3155972"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9173947"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT50566.2022.9834604"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2023.3265512"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.ffa.2004.11.001"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1985.1057113"},{"key":"ref12","volume-title":"The theory of error correcting codes","volume":"16","author":"MacWilliams","year":"1977"},{"key":"ref13","volume-title":"Abstract Algebra","author":"Dummit","year":"2003"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT54713.2023.10206604"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/tit.2024.3435346"},{"key":"ref16","volume-title":"Corrupted fragment on decode. issue #10. Intel\/ISA-L"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/18.45291"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2012.02.032"},{"key":"ref19","article-title":"Superregular matrices over small finite fields","volume":"abs\/2008.00215","author":"Almeida","year":"2020","journal-title":"ArXiv"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2008.02.011"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2013.06.013"},{"key":"ref22","doi-asserted-by":"crossref","volume-title":"On Low Field Size Constructions of Access-Optimal Convertible Codes","author":"Chopra","DOI":"10.1109\/ISIT57864.2024.10619440"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/322217.322225"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-09519-5_73"}],"event":{"name":"2024 IEEE International Symposium on Information Theory (ISIT)","location":"Athens, Greece","start":{"date-parts":[[2024,7,7]]},"end":{"date-parts":[[2024,7,12]]}},"container-title":["2024 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10619013\/10619074\/10619440.pdf?arnumber=10619440","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:28:59Z","timestamp":1773347339000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10619440\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,7]]},"references-count":24,"URL":"https:\/\/doi.org\/10.1109\/isit57864.2024.10619440","relation":{},"subject":[],"published":{"date-parts":[[2024,7,7]]}}}