{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T06:50:19Z","timestamp":1774680619659,"version":"3.50.1"},"reference-count":47,"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":"National Science Foundation CAREER Award","doi-asserted-by":"publisher","award":["CCF 1453121"],"award-info":[{"award-number":["CCF 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.2472521","type":"journal-article","created":{"date-parts":[[2015,8,25]],"date-time":"2015-08-25T14:33:47Z","timestamp":1440513227000},"page":"5810-5821","source":"Crossref","is-referenced-by-count":34,"title":["Storage Capacity of Repairable Networks"],"prefix":"10.1109","volume":"61","author":[{"given":"Arya","family":"Mazumdar","sequence":"first","affiliation":[]}],"member":"263","reference":[{"key":"ref39","author":"shanmugam","year":"2015"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/BF01200760"},{"key":"ref33","first-page":"310","article-title":"Packing directed cycles efficiently","author":"nutov","year":"2004","journal-title":"Mathematical Foundations of Computer Science"},{"key":"ref32","doi-asserted-by":"crossref","first-page":"345","DOI":"10.3934\/amc.2010.4.345","article-title":"On linear balancing sets","volume":"4","author":"mazumdar","year":"2010","journal-title":"Adv Math Commun"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6875179"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2014.7028551"},{"key":"ref37","article-title":"Graph entropy, network coding and guessing games","author":"riis","year":"2007"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/BF01271272"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/CISS.2014.6814152"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6284027"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/NetCod.2013.6570829"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6874842"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6034005"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2008.4544612"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1983.1056678"},{"key":"ref14","volume":"54","author":"cohen","year":"1997","journal-title":"Covering Codes"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1986.1057249"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2054295"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.4007\/annals.2005.162.439"},{"key":"ref18","first-page":"361","article-title":"Paths, trees, and flowers","author":"edmonds","year":"1987","journal-title":"Classic Papers in Combinatorics"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2048502"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(75)90058-8"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/800070.802205"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2008.4594999"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/174644.174650"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.874540"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2023702"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.42"},{"key":"ref8","first-page":"196","article-title":"Covering the Hamming space with sets translated by vectors of a linear code","volume":"26","author":"blinovskii","year":"1990","journal-title":"Problems Inf Transmiss"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.39"},{"key":"ref2","first-page":"1447","article-title":"Automorphism groups, isomorphism, and reconstruction","author":"babai","year":"1995","journal-title":"Handbook of Combinatorics"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2011.04.008"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2008.41"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2008.11.004"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1965-035-8"},{"key":"ref45","author":"vazirani","year":"2001","journal-title":"Approximation Algorithms"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2208937"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1137\/0210022"},{"key":"ref21","article-title":"Coding for a discrete information source with a distortion measure","author":"goblick","year":"1963"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620541"},{"key":"ref24","article-title":"Codes with local regeneration","author":"kamath","year":"2012"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1956.1056798"},{"key":"ref23","first-page":"267","article-title":"An upper bound for the Shannon capacity of a graph","volume":"25","author":"haemers","year":"1978","journal-title":"Colloq Math Soc J Bolyai"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620540"},{"key":"ref26","first-page":"411","article-title":"Coding of an information source having ambiguous alphabet and the entropy of graphs","author":"k\u00f6rner","year":"1973","journal-title":"Proc 6th Prague Conf Inf Theory"},{"key":"ref43","article-title":"A family of optimal locally recoverable codes","author":"tamo","year":"2013"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2007.06.019"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/7299738\/07222436.pdf?arnumber=7222436","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\/7222436\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,11]]},"references-count":47,"journal-issue":{"issue":"11"},"URL":"https:\/\/doi.org\/10.1109\/tit.2015.2472521","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,11]]}}}