{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T13:00:11Z","timestamp":1772283611593,"version":"3.50.1"},"reference-count":16,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,6]]},"DOI":"10.1109\/isit.2017.8006916","type":"proceedings-article","created":{"date-parts":[[2017,8,29]],"date-time":"2017-08-29T14:54:37Z","timestamp":1504018477000},"page":"2183-2187","source":"Crossref","is-referenced-by-count":2,"title":["Multiset combinatorial batch codes"],"prefix":"10.1109","author":[{"given":"Hui","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Eitan","family":"Yaakobi","sequence":"additional","affiliation":[]},{"given":"Natalia","family":"Silberstein","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1980.1056141"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007396"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.3934\/amc.2009.3.13"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2524510"},{"key":"ref14","article-title":"Fractional repetition and erasure batch codes","author":"silberstein","year":"2014","journal-title":"Coding Theory and Applications 4th International Castle Meeting"},{"key":"ref15","first-page":"1","article-title":"Optimal combinatorial batch codes based on block designs","author":"silberstein","year":"2014","journal-title":"Des Codes Cryptogr"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541377"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.endm.2011.09.034"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.3934\/amc.2010.4.419"},{"key":"ref6","doi-asserted-by":"crossref","first-page":"11","DOI":"10.18514\/MMN.2011.325","article-title":"Optimal combinatorial batch codes derived from dual systems","volume":"12","author":"bujtas","year":"2011","journal-title":"Miskolc Mathematical Notes"},{"key":"ref5","doi-asserted-by":"crossref","first-page":"529","DOI":"10.3934\/amc.2011.5.529","article-title":"Optimal batch codes: many items or low retrieval requirement","volume":"5","author":"bujtas","year":"2011","journal-title":"Adv Math Commun"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2015.01.006"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.2298\/AADM111130024B"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.3934\/amc.2012.6.165"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2013.08.046"},{"key":"ref9","first-page":"102","author":"colbourn","year":"2007","journal-title":"Steiner systems Handbook of Combinatorial Designs"}],"event":{"name":"2017 IEEE International Symposium on Information Theory (ISIT)","location":"Aachen, Germany","start":{"date-parts":[[2017,6,25]]},"end":{"date-parts":[[2017,6,30]]}},"container-title":["2017 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7999336\/8006474\/08006916.pdf?arnumber=8006916","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,2]],"date-time":"2019-10-02T18:20:00Z","timestamp":1570040400000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8006916\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/isit.2017.8006916","relation":{},"subject":[],"published":{"date-parts":[[2017,6]]}}}