{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:21:48Z","timestamp":1740122508890,"version":"3.37.3"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2018,2,23]],"date-time":"2018-02-23T00:00:00Z","timestamp":1519344000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100005385","name":"Council for Higher Education","doi-asserted-by":"publisher","award":["The PBC Fellowship Program for Outstanding Post-Doctoral Researchers from China and India"],"award-info":[{"award-number":["The PBC Fellowship Program for Outstanding Post-Doctoral Researchers from China and India"]}],"id":[{"id":"10.13039\/501100005385","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2018,11]]},"DOI":"10.1007\/s10623-018-0468-3","type":"journal-article","created":{"date-parts":[[2018,2,23]],"date-time":"2018-02-23T05:35:28Z","timestamp":1519364128000},"page":"2645-2660","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Multiset combinatorial batch codes"],"prefix":"10.1007","volume":"86","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7816-0408","authenticated-orcid":false,"given":"Hui","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Eitan","family":"Yaakobi","sequence":"additional","affiliation":[]},{"given":"Natalia","family":"Silberstein","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,2,23]]},"reference":[{"key":"468_CR1","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/0012-365X(90)90136-6","volume":"84","author":"R Aharoni","year":"1990","unstructured":"Aharoni R., Kessler O.: On a possible extension of Hall\u2019s theorem to bipartite hypergraphs. Discret. Math. 84, 309\u2013313 (1990).","journal-title":"Discret. Math."},{"key":"468_CR2","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1016\/j.dam.2013.08.046","volume":"162","author":"N Balachandran","year":"2014","unstructured":"Balachandran N., Bhattacharya S.: On an extremal hypergraph problem related to combinatorial batch codes. Discret. Appl. Math. 162, 373\u2013380 (2014).","journal-title":"Discret. Appl. Math."},{"key":"468_CR3","doi-asserted-by":"publisher","first-page":"165","DOI":"10.3934\/amc.2012.6.165","volume":"6","author":"S Bhattacharya","year":"2012","unstructured":"Bhattacharya S., Ruj S., Roy B.: Combinatorial batch codes: a lower bound and optimal constructions. Adv. Math. Commun. 6, 165\u2013174 (2012).","journal-title":"Adv. Math. Commun."},{"issue":"6","key":"468_CR4","doi-asserted-by":"publisher","first-page":"1334","DOI":"10.1109\/18.59932","volume":"36","author":"AE Brouwer","year":"1990","unstructured":"Brouwer A.E., Shearer J.B., Sloane N.J.A., Smith W.D.: A new table of constant weight codes. IEEE Trans. Inf. Theory 36(6), 1334\u20131380 (1990).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"468_CR5","doi-asserted-by":"publisher","first-page":"419","DOI":"10.3934\/amc.2010.4.419","volume":"4","author":"RA Brualdi","year":"2010","unstructured":"Brualdi R.A., Kiernan K.P., Meyer S.A., Schroeder M.W.: Combinatorial batch codes and transversal matroids. Adv. Math. Commun. 4, 419\u2013431 (2010).","journal-title":"Adv. Math. Commun."},{"key":"468_CR6","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/j.endm.2011.09.034","volume":"38","author":"C Bujt\u00e1s","year":"2011","unstructured":"Bujt\u00e1s C., Tuza Z.: Combinatorial batch codes: extremal problems under Hall-type conditions. Electr. Notes in Discret. Math. 38, 201\u2013206 (2011).","journal-title":"Electr. Notes in Discret. Math."},{"key":"468_CR7","doi-asserted-by":"publisher","first-page":"529","DOI":"10.3934\/amc.2011.5.529","volume":"5","author":"C Bujt\u00e1s","year":"2011","unstructured":"Bujt\u00e1s C., Tuza Z.: Optimal batch codes: many items or low retrieval requirement. Adv. Math. Commun. 5, 529\u2013541 (2011).","journal-title":"Adv. Math. Commun."},{"issue":"1","key":"468_CR8","doi-asserted-by":"crossref","first-page":"11","DOI":"10.18514\/MMN.2011.325","volume":"12","author":"C Bujt\u00e1s","year":"2011","unstructured":"Bujt\u00e1s C., Tuza Z.: Optimal combinatorial batch codes derived from dual systems. Miskolc Math. Notes 12(1), 11\u201323 (2011).","journal-title":"Miskolc Math. Notes"},{"issue":"1","key":"468_CR9","doi-asserted-by":"publisher","first-page":"72","DOI":"10.2298\/AADM111130024B","volume":"6","author":"C Bujt\u00e1s","year":"2012","unstructured":"Bujt\u00e1s C., Tuza Z.: Relaxations of Hall\u2019s condition: optimal batch codes with multiple queries. Appl. Anal. Discret. Math. 6(1), 72\u201381 (2012).","journal-title":"Appl. Anal. Discret. Math."},{"key":"468_CR10","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/j.dam.2015.01.006","volume":"186","author":"C Bujt\u00e1s","year":"2015","unstructured":"Bujt\u00e1s C., Tuza Z.: Tur\u00e1n numbers and batch codes. Discret. Appl. Math. 186, 45\u201355 (2015).","journal-title":"Discret. Appl. Math."},{"key":"468_CR11","first-page":"102","volume-title":"Handbook of Combinatorial Designs","author":"CJ Colbourn","year":"2007","unstructured":"Colbourn C.J., Mathon R.: Steiner systems. In: Colbourn C.J., Dinitz J.H. (eds.) Handbook of Combinatorial Designs, 2nd edn, pp. 102\u2013110. Chapman & Hall\/CRC, Boca Raton (2007).","edition":"2"},{"key":"468_CR12","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1109\/TIT.1980.1056141","volume":"26","author":"RL Graham","year":"1980","unstructured":"Graham R.L., Sloane N.J.A.: Lower bounds for constant weight codes. IEEE Trans. Inf. Theory 26, 37\u201343 (1980).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"468_CR13","doi-asserted-by":"crossref","unstructured":"Ishai Y., Kushilevitz E., Ostrovsky R., Sahai A.: Batch codes and their applications. In: Proceedings of the 36-Sixth Annual ACM Symposium on Theory of Computing STOC \u201904, pp. 262\u2013271 (2004).","DOI":"10.1145\/1007352.1007396"},{"key":"468_CR14","first-page":"25","volume-title":"Handbook of Combinatorial Designs","author":"M Mathon","year":"2007","unstructured":"Mathon M., Rosa R.: 2-\n                    \n                      \n                    \n                    $$(v, k,\\lambda )$$\n                    \n                      \n                        \n                          (\n                          v\n                          ,\n                          k\n                          ,\n                          \u03bb\n                          )\n                        \n                      \n                    \n                   designs of small order. In: Colbourn C.J., Dinitz J.H. (eds.) Handbook of Combinatorial Designs, 2nd edn, pp. 25\u201358. Chapman & Hall\/CRC, Boca Raton (2007).","edition":"2"},{"key":"468_CR15","doi-asserted-by":"publisher","first-page":"1135","DOI":"10.1017\/S0305004100042213","volume":"63","author":"L Mirsky","year":"1967","unstructured":"Mirsky L.: Systems of representatives with repetition. Proc. Camb. Philos. Soc. 63, 1135\u20131140 (1967).","journal-title":"Proc. Camb. Philos. Soc."},{"key":"468_CR16","doi-asserted-by":"publisher","first-page":"520","DOI":"10.1016\/0022-247X(66)90106-5","volume":"15","author":"L Mirsky","year":"1966","unstructured":"Mirsky L., Perfect H.: Systems of representatives. J. Math. Anal. Appl. 15, 520\u2013568 (1966).","journal-title":"J. Math. Anal. Appl."},{"key":"468_CR17","doi-asserted-by":"publisher","first-page":"13","DOI":"10.3934\/amc.2009.3.13","volume":"3","author":"MB Paterson","year":"2009","unstructured":"Paterson M.B., Stinson D.R., Wei R.: Combinatorial batch codes. Adv. Math. Commun. 3, 13\u201327 (2009).","journal-title":"Adv. Math. Commun."},{"key":"468_CR18","doi-asserted-by":"publisher","first-page":"4481","DOI":"10.1109\/TIT.2016.2524510","volume":"62","author":"AS Rawat","year":"2016","unstructured":"Rawat A.S., Papailiopoulos D.S., Dimakis A.G., Vishwanath S.: Locality and availability in distributed storage. IEEE Trans. Inf. Theory 62, 4481\u20134493 (2016).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"468_CR19","unstructured":"Silberstein N.: Fractional repetition and erasure batch codes. In: Proceedings of the 4th International Castle Meeting on Coding Theory and Applications, Palmela, Portugal (2014)."},{"key":"468_CR20","first-page":"1","volume":"78","author":"N Silberstein","year":"2014","unstructured":"Silberstein N., G\u00e1l A.: Optimal combinatorial batch codes based on block designs. Des. Codes Cryptogr. 78, 1\u201316 (2014).","journal-title":"Des. Codes Cryptogr."},{"key":"468_CR21","doi-asserted-by":"crossref","unstructured":"Zeh A., Yaakobi E.: Bounds and constructions of codes with multiple localities. In: Proceedings of the IEEE International Symposium Information Theory (ISIT), Barcelona, Spain, pp. 640\u2013644 (2016).","DOI":"10.1109\/ISIT.2016.7541377"},{"key":"468_CR22","doi-asserted-by":"crossref","unstructured":"Zhang H., Yaakobi E., Silberstein N.: Multiset combinatorial batch codes. In: Proceedings of the IEEE International Symposium on Information Theory (ISIT), Aachen, Germany, pp. 2183\u20132187 (2017).","DOI":"10.1109\/ISIT.2017.8006916"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-018-0468-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-018-0468-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-018-0468-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,22]],"date-time":"2019-02-22T20:28:35Z","timestamp":1550867315000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-018-0468-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,2,23]]},"references-count":22,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2018,11]]}},"alternative-id":["468"],"URL":"https:\/\/doi.org\/10.1007\/s10623-018-0468-3","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2018,2,23]]},"assertion":[{"value":"11 January 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 February 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 February 2018","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 February 2018","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}