{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T11:49:05Z","timestamp":1778154545450,"version":"3.51.4"},"reference-count":11,"publisher":"American Institute of Mathematical Sciences (AIMS)","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["AMC"],"published-print":{"date-parts":[[2018]]},"DOI":"10.3934\/amc.2018003","type":"journal-article","created":{"date-parts":[[2018,4,11]],"date-time":"2018-04-11T23:52:21Z","timestamp":1523490741000},"page":"49-65","source":"Crossref","is-referenced-by-count":5,"title":["On erasure combinatorial batch codes"],"prefix":"10.3934","volume":"12","author":[{"given":"JiYoon","family":"Jung","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carl","family":"Mummert","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elizabeth","family":"Niese","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Schroeder","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"2321","reference":[{"key":"key-10.3934\/amc.2018003-1","doi-asserted-by":"publisher","DOI":"10.1016\/j.aml.2011.09.062"},{"key":"key-10.3934\/amc.2018003-2","doi-asserted-by":"publisher","DOI":"10.3934\/amc.2010.4.419"},{"key":"key-10.3934\/amc.2018003-3","doi-asserted-by":"publisher","DOI":"10.3934\/amc.2011.5.529"},{"key":"key-10.3934\/amc.2018003-4"},{"key":"key-10.3934\/amc.2018003-5","doi-asserted-by":"publisher","DOI":"10.2298\/AADM111130024B"},{"key":"key-10.3934\/amc.2018003-6","doi-asserted-by":"crossref","unstructured":"<p>Y. Ishai, E. Kushilevitz, R. Ostrovsky and A. Sahai, Batch codes and their applications, in <i>Proc. 36th Ann. ACM Symp. Theory Comp<\/i>., ACM, New York, 2004,262\u2013271.<\/p>","DOI":"10.1145\/1007352.1007396"},{"key":"key-10.3934\/amc.2018003-7","unstructured":"<p>G. B. Khosrovshahi and R. Laue, <i>t<\/i>-Designs with <i>t<\/i> \u2265 3, in <i>Handbook of Combinatorial Designs<\/i> (eds. C. J. Colbourn and J. H. Dinitz), 2nd edition, Chapman &amp; Hall\/CRC, Boca Raton, 2007, 79\u2013100.<\/p>"},{"key":"key-10.3934\/amc.2018003-8","unstructured":"<p>W. H. Mills and R. C. Mullin, Coverings and packings, in <i>Contemporary Design Theory<\/i>, Wiley, New York, 1992,371\u2013399.<\/p>"},{"key":"key-10.3934\/amc.2018003-9","doi-asserted-by":"publisher","DOI":"10.3934\/amc.2009.3.13"},{"key":"key-10.3934\/amc.2018003-10","doi-asserted-by":"crossref","unstructured":"<p>N. Silberstein, Fractional repetition and erasure batch codes, in <i>Coding Theory and Applications<\/i> (eds. R. Pinto, P. Rocha Malonek and P. Vettori), Springer, 2015,335\u2013343.<\/p>","DOI":"10.1007\/978-3-319-17296-5_36"},{"key":"key-10.3934\/amc.2018003-11","doi-asserted-by":"crossref","unstructured":"<p>H. Zhang, E. Yaakobi and N. Silberstein, Multiset combinatorial batch codes, in <i>2017 IEEE Int. Symp. Inf. Theory (ISIT)<\/i>, IEEE, 2017.<\/p>","DOI":"10.1109\/ISIT.2017.8006916"}],"container-title":["Advances in Mathematics of Communications"],"original-title":[],"link":[{"URL":"https:\/\/aimsciences.org\/download\/files\/1930-5346_2018_1_49.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T10:05:59Z","timestamp":1772791559000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.aimsciences.org\/\/article\/doi\/10.3934\/amc.2018003"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"references-count":11,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018]]}},"URL":"https:\/\/doi.org\/10.3934\/amc.2018003","relation":{},"ISSN":["1930-5346","1930-5338"],"issn-type":[{"value":"1930-5346","type":"print"},{"value":"1930-5338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]}}}