{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T03:24:14Z","timestamp":1725420254025},"reference-count":22,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014,9]]},"DOI":"10.1109\/allerton.2014.7028551","type":"proceedings-article","created":{"date-parts":[[2015,2,5]],"date-time":"2015-02-05T19:24:07Z","timestamp":1423164247000},"page":"909-913","source":"Crossref","is-referenced-by-count":3,"title":["Achievable schemes and limits for local recovery on a graph"],"prefix":"10.1109","author":[{"given":"Arya","family":"Mazumdar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"journal-title":"A Family of Optimal Locally Recoverable Codes","year":"2013","author":"tamo","key":"19"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1137\/0210022"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1007\/BF01200760"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6874842"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/CISS.2014.6814152"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1007\/BF01271272"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6875179"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-28629-5_22"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2208937"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2007.06.019"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2008.11.004"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1145\/800070.802205"},{"journal-title":"Approximation Algorithms","year":"2001","author":"vazirani","key":"20"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1145\/174644.174650"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2008.41"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1965-035-8"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6034005"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/NetCod.2013.6570829"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2011.04.008"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.42"},{"key":"9","first-page":"361","article-title":"Paths, trees and flowers","author":"edmonds","year":"1987","journal-title":"Classic Papers in Combinatorics"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.4007\/annals.2005.162.439"}],"event":{"name":"2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton)","start":{"date-parts":[[2014,9,30]]},"location":"Monticello, IL, USA","end":{"date-parts":[[2014,10,3]]}},"container-title":["2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7008053\/7028426\/07028551.pdf?arnumber=7028551","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,24]],"date-time":"2017-03-24T05:31:33Z","timestamp":1490333493000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7028551\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,9]]},"references-count":22,"URL":"https:\/\/doi.org\/10.1109\/allerton.2014.7028551","relation":{},"subject":[],"published":{"date-parts":[[2014,9]]}}}