{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,14]],"date-time":"2026-06-14T18:55:07Z","timestamp":1781463307535,"version":"3.54.1"},"reference-count":17,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100003787","name":"Hebei Provincial Natural Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003787","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2026,10]]},"DOI":"10.1016\/j.dam.2026.04.038","type":"journal-article","created":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T23:02:23Z","timestamp":1778108543000},"page":"57-67","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["On generalized combinatorial batch codes"],"prefix":"10.1016","volume":"391","author":[{"given":"Zhengyu","family":"Guo","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gengsheng","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.dam.2026.04.038_b1","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1016\/j.dam.2013.08.046","article-title":"On an extremal hypergraph problem related to combinatorial batch codes","volume":"162","author":"Balachandran","year":"2014","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2026.04.038_b2","series-title":"Hypergraphs: Combinatorics of Finite Sets","author":"Berge","year":"1973"},{"key":"10.1016\/j.dam.2026.04.038_b3","doi-asserted-by":"crossref","first-page":"165","DOI":"10.3934\/amc.2012.6.165","article-title":"Combinatorial batch codes: a lower bound and optimal constructions","volume":"6","author":"Bhattacharya","year":"2012","journal-title":"Adv. Math. Commun."},{"key":"10.1016\/j.dam.2026.04.038_b4","doi-asserted-by":"crossref","first-page":"419","DOI":"10.3934\/amc.2010.4.419","article-title":"Combinatorial batch codes and transversal matroids","volume":"4","author":"Brualdi","year":"2010","journal-title":"Adv. Math. Commun."},{"key":"10.1016\/j.dam.2026.04.038_b5","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":"Bujt\u00e1s","year":"2011","journal-title":"Adv. Math. Commun."},{"key":"10.1016\/j.dam.2026.04.038_b6","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":"Bujt\u00e1s","year":"2011","journal-title":"Miskolc Math. Notes"},{"key":"10.1016\/j.dam.2026.04.038_b7","series-title":"2021 IEEE International Symposium on Information Theory","first-page":"3133","article-title":"Regular multiset combinatorial batch codes over vector spaces","author":"Chee","year":"2021"},{"issue":"1","key":"10.1016\/j.dam.2026.04.038_b8","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1109\/TIT.2020.3029720","article-title":"Lower bounds for total storage of multiset combinatorial batch codes using linear programming","volume":"67","author":"Chee","year":"2020","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/j.dam.2026.04.038_b9","doi-asserted-by":"crossref","unstructured":"Y. Ishai, E. Kushilevitz, R. Ostrovsky, A. Sahai, Batch codes and their applications, in: Proceedings of the Thirty-Sixth Annual ACM Symposium on Theory of Computing STOC\u2019 04, 36, New York, USA, 2004, pp. 262\u2013271.","DOI":"10.1145\/1007352.1007396"},{"key":"10.1016\/j.dam.2026.04.038_b10","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/j.dam.2019.02.031","article-title":"Some optimal combinatorial batch codes with k=5","volume":"262","author":"Jia","year":"2019","journal-title":"Discrete Appl. Math."},{"issue":"7","key":"10.1016\/j.dam.2026.04.038_b11","doi-asserted-by":"crossref","first-page":"1647","DOI":"10.1007\/s10623-018-0564-4","article-title":"Erasure combinatorial batch codes based on nonadaptive group testing","volume":"87","author":"Jia","year":"2019","journal-title":"Des. Codes Cryptogr."},{"key":"10.1016\/j.dam.2026.04.038_b12","doi-asserted-by":"crossref","first-page":"49","DOI":"10.3934\/amc.2018003","article-title":"On erasure combinatorial batch codes","volume":"12","author":"Jung","year":"2018","journal-title":"Adv. Math. Commun."},{"key":"10.1016\/j.dam.2026.04.038_b13","series-title":"2023 59th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","first-page":"1","article-title":"New results on erasure combinatorial batch codes","author":"Le","year":"2023"},{"key":"10.1016\/j.dam.2026.04.038_b14","doi-asserted-by":"crossref","first-page":"13","DOI":"10.3934\/amc.2009.3.13","article-title":"Combinatorial batch codes","volume":"3","author":"Paterson","year":"2009","journal-title":"Adv. Math. Commun."},{"issue":"2","key":"10.1016\/j.dam.2026.04.038_b15","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1007\/s10623-014-0007-9","article-title":"Optimal combinatorial batch codes based on block designs","volume":"78","author":"Silberstein","year":"2016","journal-title":"Des. Codes Cryptogr."},{"key":"10.1016\/j.dam.2026.04.038_b16","series-title":"Design Theory","author":"Wan","year":"2009"},{"key":"10.1016\/j.dam.2026.04.038_b17","doi-asserted-by":"crossref","first-page":"2645","DOI":"10.1007\/s10623-018-0468-3","article-title":"Multiset combinatorial batch codes","volume":"86","author":"Zhang","year":"2018","journal-title":"Des. Codes Cryptogr."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X26002556?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X26002556?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,6,14]],"date-time":"2026-06-14T18:08:07Z","timestamp":1781460487000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X26002556"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,10]]},"references-count":17,"alternative-id":["S0166218X26002556"],"URL":"https:\/\/doi.org\/10.1016\/j.dam.2026.04.038","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2026,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"On generalized combinatorial batch codes","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.dam.2026.04.038","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}]}}