{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:39:18Z","timestamp":1773376758383,"version":"3.50.1"},"reference-count":30,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,6,25]],"date-time":"2023-06-25T00:00:00Z","timestamp":1687651200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,6,25]],"date-time":"2023-06-25T00:00:00Z","timestamp":1687651200000},"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":[[2023,6,25]]},"DOI":"10.1109\/isit54713.2023.10206840","type":"proceedings-article","created":{"date-parts":[[2023,8,22]],"date-time":"2023-08-22T13:31:15Z","timestamp":1692711075000},"page":"2021-2026","source":"Crossref","is-referenced-by-count":3,"title":["On a Class of Optimal Locally Recoverable Codes with Availability"],"prefix":"10.1109","author":[{"given":"Clifton","family":"Garrison","sequence":"first","affiliation":[{"name":"University of South Florida,Tampa,33620"}]},{"given":"Giacomo","family":"Micheli","sequence":"additional","affiliation":[{"name":"University of South Florida,Tampa,33620"}]},{"given":"Logan","family":"Nott","sequence":"additional","affiliation":[{"name":"University of South Florida,Tampa,33620"}]},{"given":"Vincenzo Pallozzi","family":"Lavorante","sequence":"additional","affiliation":[{"name":"University of South Florida,Tampa,33620"}]},{"given":"Phillip","family":"Waitkevich","sequence":"additional","affiliation":[{"name":"University of South Florida,Tampa,33620"}]}],"member":"263","reference":[{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-020-00731-0"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2713245"},{"key":"ref15","article-title":"Optimal locally repairable and secure codes for distributed storage systems","volume":"abs 1210 6954","author":"rawat","year":"2012","journal-title":"IEEE Transactions on Information Theory"},{"key":"ref14","article-title":"Constructions of locally recoverable codes which are optimal","author":"micheli","year":"2019","journal-title":"IEEE Transactions on Information Theory"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282656"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-022-01046-y"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2944397"},{"key":"ref2","first-page":"1","article-title":"Storage-repair band-width trade-off for wireless caching with partial failure and broadcast repair","author":"mital","year":"2018","journal-title":"2018 IEEE Information Theory Workshop (ITW)"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/800217.806614"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2014.140521"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620541"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2555813"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2321280"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2995852"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2919830"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT50566.2022.9834902"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-63931-4_4"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3161613"},{"key":"ref22","first-page":"1","article-title":"The minimum locality of linear codes","author":"tan","year":"2022","journal-title":"Designs Codes and Cryptography"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2598149"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-020-00726-x"},{"key":"ref27","first-page":"45","article-title":"Locally repairable codes with availability and hierarchy: matroid theory via examples","author":"freij-hollanti","year":"2016","journal-title":"Proc Int Zurich Seminar on Communication"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.3934\/amc.2018020"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2325570"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2208937"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6284028"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2010.2096170"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2054295"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2010.5707092"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2159049"}],"event":{"name":"2023 IEEE International Symposium on Information Theory (ISIT)","location":"Taipei, Taiwan","start":{"date-parts":[[2023,6,25]]},"end":{"date-parts":[[2023,6,30]]}},"container-title":["2023 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10206429\/10206441\/10206840.pdf?arnumber=10206840","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:28:09Z","timestamp":1773347289000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10206840\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,25]]},"references-count":30,"URL":"https:\/\/doi.org\/10.1109\/isit54713.2023.10206840","relation":{},"subject":[],"published":{"date-parts":[[2023,6,25]]}}}