{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T16:15:31Z","timestamp":1775492131416,"version":"3.50.1"},"reference-count":30,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"11","license":[{"start":{"date-parts":[[2015,11,1]],"date-time":"2015-11-01T00:00:00Z","timestamp":1446336000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/100000143","name":"NSF through the Division of Computing and Communication Foundations","doi-asserted-by":"publisher","award":["1318093"],"award-info":[{"award-number":["1318093"]}],"id":[{"id":"10.13039\/100000143","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000143","name":"NSF through the Division of Computing and Communication Foundations","doi-asserted-by":"publisher","award":["1453121"],"award-info":[{"award-number":["1453121"]}],"id":[{"id":"10.13039\/100000143","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2015,11]]},"DOI":"10.1109\/tit.2015.2477406","type":"journal-article","created":{"date-parts":[[2015,9,10]],"date-time":"2015-09-10T07:57:31Z","timestamp":1441871851000},"page":"5787-5794","source":"Crossref","is-referenced-by-count":147,"title":["Bounds on the Size of Locally Recoverable Codes"],"prefix":"10.1109","volume":"61","author":[{"given":"Viveck R.","family":"Cadambe","sequence":"first","affiliation":[]},{"given":"Arya","family":"Mazumdar","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2015.7133123"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/NCA.2007.37"},{"key":"ref11","first-page":"15","article-title":"Erasure coding in windows azure storage","author":"huang","year":"2012","journal-title":"Proc of USENIX Annual Technical Conf (USENIX)"},{"key":"ref12","first-page":"1","article-title":"Codes with local regeneration","author":"kamath","year":"2013","journal-title":"Proc IEEE Inf Theory Appl Workshop (ITA)"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620277"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/4234.781010"},{"key":"ref15","author":"macwilliams","year":"1977","journal-title":"The Theory of Error-Correcting Codes"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ITA.2013.6502958"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2014.140517"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1977.1055688"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2011.5934901"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6874920"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/NetCod.2013.6570829"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282655"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.1999.767979"},{"key":"ref6","author":"forney","year":"1966","journal-title":"Concatenated Codes"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620540"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/2447712.2447735"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2208937"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1962.1057683"},{"key":"ref2","doi-asserted-by":"crossref","first-page":"433","DOI":"10.3934\/amc.2008.2.433","article-title":"Weight distribution and decoding of codes on hypergraphs","volume":"2","author":"barg","year":"2008","journal-title":"Adv Math Commun"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6874918"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/18.904536"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6284027"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6284028"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2012.6195703"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/CISS.2014.6814152"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2288784"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.14778\/2535573.2488339"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511808968"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/7299738\/07247728.pdf?arnumber=7247728","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:45:42Z","timestamp":1641987942000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7247728\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,11]]},"references-count":30,"journal-issue":{"issue":"11"},"URL":"https:\/\/doi.org\/10.1109\/tit.2015.2477406","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,11]]}}}