{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T18:28:20Z","timestamp":1777141700384,"version":"3.51.4"},"reference-count":41,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"12","license":[{"start":{"date-parts":[[2016,12,1]],"date-time":"2016-12-01T00:00:00Z","timestamp":1480550400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/100000179","name":"National Science Foundation Office of the Director","doi-asserted-by":"publisher","award":["1344179"],"award-info":[{"award-number":["1344179"]}],"id":[{"id":"10.13039\/100000179","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000179","name":"National Science Foundation Office of the Director","doi-asserted-by":"publisher","award":["1344364"],"award-info":[{"award-number":["1344364"]}],"id":[{"id":"10.13039\/100000179","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF1217894"],"award-info":[{"award-number":["CCF1217894"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2016,12]]},"DOI":"10.1109\/tit.2016.2555813","type":"journal-article","created":{"date-parts":[[2016,4,21]],"date-time":"2016-04-21T18:18:34Z","timestamp":1461262714000},"page":"6661-6671","source":"Crossref","is-referenced-by-count":118,"title":["Optimal Locally Repairable Codes and Connections to Matroid Theory"],"prefix":"10.1109","volume":"62","author":[{"given":"Itzhak","family":"Tamo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dimitris S.","family":"Papailiopoulos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4244-7033","authenticated-orcid":false,"given":"Alexandros G.","family":"Dimakis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6283512"},{"key":"ref38","first-page":"219","article-title":"Error-set codes and related objects","author":"jurrius","year":"2011","journal-title":"Algebraic Geometry Modeling in Inf Theory"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2014.6970906"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.896862"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(78)91063-X"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1137\/070691152"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2007.08.064"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/11533719_59"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1002\/sapm1976552119"},{"key":"ref34","article-title":"On the combinatorics of locally repairable codes via matroid theory","author":"westerb\u00e4ck","year":"2015"},{"key":"ref10","first-page":"6","article-title":"In search of I\/O-optimal recovery from disk failures","author":"khan","year":"2011","journal-title":"Proc 3rd USENIX Conf on Hot Topics in Storage and File Syst"},{"key":"ref40","article-title":"Explicit maximally recoverable codes with locality","author":"gopalan","year":"2013"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2208937"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2011.5934901"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6284027"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557599"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/NCA.2007.37"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6284028"},{"key":"ref17","article-title":"Codes with local regeneration","author":"kamath","year":"2012"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2288784"},{"key":"ref19","article-title":"On the locality of codeword symbols in non-linear codes","author":"forbes","year":"2013"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2005.10.002"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2054295"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2006.12.001"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.14778\/2535573.2488339"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2105003"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.924700"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2159049"},{"key":"ref8","article-title":"Optimal repair of MDS codes in distributed storage via subspace interference alignment","author":"cadambe","year":"2011"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6033733"},{"key":"ref2","first-page":"2","article-title":"Erasure coding in windows azure storage","author":"huang","year":"2012","journal-title":"Proc of USENIX Annual Technical Conf (USENIX)"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2011.6120328"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45748-8_31"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ITA.2013.6502958"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/NetCod.2013.6570829"},{"key":"ref21","article-title":"Update-efficiency and local repairability limits for capacity approaching codes","author":"mazumdar","year":"2013"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2012.6483348"},{"key":"ref41","author":"van lint","year":"1992","journal-title":"A Course in Combinatorics"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2012.6404723"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/s002000050060"},{"key":"ref25","article-title":"A family of optimal locally recoverable codes","author":"tamo","year":"2013"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/7748579\/07456275.pdf?arnumber=7456275","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:20:47Z","timestamp":1642004447000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7456275\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,12]]},"references-count":41,"journal-issue":{"issue":"12"},"URL":"https:\/\/doi.org\/10.1109\/tit.2016.2555813","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,12]]}}}