{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T05:24:54Z","timestamp":1729661094291,"version":"3.28.0"},"reference-count":27,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015,6]]},"DOI":"10.1109\/isit.2015.7282701","type":"proceedings-article","created":{"date-parts":[[2015,10,1]],"date-time":"2015-10-01T18:09:52Z","timestamp":1443722992000},"page":"1477-1481","source":"Crossref","is-referenced-by-count":3,"title":["Batch codes through dense graphs without short cycles"],"prefix":"10.1109","author":[{"given":"Ankit Singh","family":"Rawat","sequence":"first","affiliation":[]},{"given":"Zhao","family":"Song","sequence":"additional","affiliation":[]},{"given":"Alexandros G.","family":"Dimakis","sequence":"additional","affiliation":[]},{"given":"Anna","family":"Gal","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2013.08.046"},{"key":"ref11","article-title":"Optimal combinatorial batch codes based on block designs","volume":"abs 1312 5505","author":"silberstein","year":"2013","journal-title":"CoRR"},{"key":"ref12","article-title":"More on combinatorial batch codes","volume":"abs 809 3357","author":"ruj","year":"2008","journal-title":"CoRR"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.3934\/amc.2009.3.13"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.3934\/amc.2012.6.165"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.3934\/amc.2010.4.419"},{"key":"ref16","doi-asserted-by":"crossref","DOI":"10.18514\/MMN.2011.325","article-title":"Optimal combinatorial batch codes derived from dual systems","volume":"12","author":"bujt\u00e1s","year":"2011","journal-title":"Miskolc Mathematical Notes"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6874919"},{"key":"ref18","article-title":"A family of optimal locally recoverable codes","volume":"abs 1311 3284","author":"tamo","year":"2013","journal-title":"CoRR"},{"key":"ref19","article-title":"Repair locality with multiple erasure tolerance","volume":"abs 1306 4774","author":"wang","year":"2013","journal-title":"CoRR"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1006\/jctb.1994.1036"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1006\/jcta.1997.2745"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.14778\/2535573.2488339"},{"key":"ref6","first-page":"33","article-title":"A construction of small regular bipartite graphs of girth 8","volume":"11","author":"balbuena","year":"2009","journal-title":"Discrete Math Theor Comput Sci"},{"key":"ref5","first-page":"135","article-title":"The maximum size of 4- and 6-cycle free bipartite graphs on m, n vertices","author":"de caen","year":"1991","journal-title":"In Graphs Sets and Numbers Coll Math Soc J Bolyai"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/2422436.2422494"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993660"},{"key":"ref2","article-title":"Erasure coding in windows azure storage","author":"huang","year":"2012","journal-title":"Proc of USENIX ATC"},{"key":"ref9","first-page":"540","article-title":"Local correctability of expander codes","author":"hemenway","year":"2013","journal-title":"Proc of ICALP"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007396"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2208937"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2288784"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6284027"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2011.5934901"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2329872"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1137\/070688225"},{"key":"ref25","article-title":"Batch codes through dense graphs without short cycles","volume":"abs 1410 2920","author":"dimakis","year":"2014","journal-title":"CoRR"}],"event":{"name":"2015 IEEE International Symposium on Information Theory (ISIT)","start":{"date-parts":[[2015,6,14]]},"location":"Hong Kong, Hong Kong","end":{"date-parts":[[2015,6,19]]}},"container-title":["2015 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7270906\/7282397\/07282701.pdf?arnumber=7282701","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,31]],"date-time":"2019-08-31T01:16:40Z","timestamp":1567214200000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7282701\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6]]},"references-count":27,"URL":"https:\/\/doi.org\/10.1109\/isit.2015.7282701","relation":{},"subject":[],"published":{"date-parts":[[2015,6]]}}}