{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,26]],"date-time":"2026-08-26T15:45:36Z","timestamp":1787759136270,"version":"build-2784847793"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T00:00:00Z","timestamp":1672185600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T00:00:00Z","timestamp":1672185600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100002301","name":"Eesti Teadusagentuur","doi-asserted-by":"publisher","award":["PRG49"],"award-info":[{"award-number":["PRG49"]}],"id":[{"id":"10.13039\/501100002301","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100008530","name":"European Regional Development Fund","doi-asserted-by":"publisher","award":["PSG114"],"award-info":[{"award-number":["PSG114"]}],"id":[{"id":"10.13039\/501100008530","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":[[2023,5]]},"DOI":"10.1007\/s10623-022-01173-6","type":"journal-article","created":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T15:03:00Z","timestamp":1672239780000},"page":"1595-1605","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["On some batch code properties of the simplex code"],"prefix":"10.1007","volume":"91","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4005-2369","authenticated-orcid":false,"given":"Henk D. L.","family":"Hollmann","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9886-2770","authenticated-orcid":false,"given":"Karan","family":"Khathuria","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8310-6809","authenticated-orcid":false,"given":"Ago-Erik","family":"Riet","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0626-2437","authenticated-orcid":false,"given":"Vitaly","family":"Skachek","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,12,28]]},"reference":[{"key":"1173_CR1","first-page":"7","volume":"8","author":"N Alon","year":"1999","unstructured":"Alon N.: Combinatorics, probability and computing. Comb. Nullstellensatz 8, 7\u201329 (1999).","journal-title":"Comb. Nullstellensatz"},{"key":"1173_CR2","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/BF02773567","volume":"117","author":"N Alon","year":"2000","unstructured":"Alon N.: Additive Latin transversals. Isr. J. Math. 117, 125\u2013130 (2000).","journal-title":"Isr. J. Math."},{"key":"1173_CR3","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1007\/s11856-011-0040-6","volume":"182","author":"B Arsovski","year":"2011","unstructured":"Arsovski B.: A proof of Snevily\u2019s conjecture. Isr. J. Math. 182, 505\u2013508 (2011).","journal-title":"Isr. J. Math."},{"key":"1173_CR4","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/BF02784149","volume":"126","author":"S Dasgupta","year":"2001","unstructured":"Dasgupta S., K\u00e1rolyi G., Serra O., Szegedy B.: Transversals of additive Latin squares. Isr. J. Math. 126, 17\u201328 (2001).","journal-title":"Isr. J. Math."},{"key":"1173_CR5","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/s11856-011-0037-1","volume":"182","author":"T Feng","year":"2011","unstructured":"Feng T., Sun Z.-W., Xiang Q.: Exterior algebras and two conjectures on finite abelian groups. Isr. J. Math. 182, 425\u2013437 (2011).","journal-title":"Isr. J. Math."},{"key":"1173_CR6","doi-asserted-by":"publisher","first-page":"1884","DOI":"10.1063\/1.1665339","volume":"11","author":"IJ Good","year":"1970","unstructured":"Good I.J.: Short proof of Dyson\u2019s conjecture. J. Math. Phys. 11, 1884 (1970).","journal-title":"J. Math. Phys."},{"issue":"4","key":"1173_CR7","doi-asserted-by":"publisher","first-page":"584","DOI":"10.1090\/S0002-9939-1952-0050579-7","volume":"3","author":"M Hall Jr","year":"1952","unstructured":"Hall M. Jr.: A combinatorial problem on abelian groups. Proc. Am. Math. Soc. 3(4), 584\u2013587 (1952).","journal-title":"Proc. Am. Math. Soc."},{"key":"1173_CR8","doi-asserted-by":"crossref","unstructured":"Hollmann H.D.L., Khathuria K., Riet A.-E., Skachek V.: On some batch code properties of the simplex code. https:\/\/www.wcc2022.uni-rostock.de\/storages\/uni-rostock\/Tagungen\/WCC2022\/Papers\/WCC_2022_paper_24.pdf.","DOI":"10.1007\/s10623-022-01173-6"},{"key":"1173_CR9","doi-asserted-by":"crossref","unstructured":"Ishai Y., Kushilevitz E., Ostrovsky R., Sahai A.: Batch codes and their applications. In: Proceedings 36th ACM Symposium on Theory of Computing (STOC), Chicago, pp. 1057\u20131061 (2004).","DOI":"10.1145\/1007352.1007396"},{"key":"1173_CR10","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/978-3-319-70293-3_16","volume-title":"Network Coding and Subspace Designs","author":"V Skachek","year":"2018","unstructured":"Skachek V.: Batch and PIR codes and their connections to locally repairable codes. In: Greferath M., Pav\u010devi\u0107 M.O., Silberstein N., \u00c1ngeles V\u00e1zquez-Castro M. (eds.) Network Coding and Subspace Designs, pp. 427\u2013442. Springer, London (2018)."},{"key":"1173_CR11","first-page":"584","volume":"1","author":"HS Snevily","year":"1999","unstructured":"Snevily H.S.: The Cayley addition table of $${{\\mathbb{Z} }_n}$$. Am. Math. Mon. 1, 584\u2013585 (1999).","journal-title":"Am. Math. Mon."},{"key":"1173_CR12","doi-asserted-by":"crossref","unstructured":"Wang Z., Kiah H.M., Cassuto Y.: Optimal binary switch codes with small query size. In: Proceedings 2015 IEEE International Symposium on Information Theory (ISIT), Hong Kong, pp. 636\u2013640 (2015).","DOI":"10.1109\/ISIT.2015.7282532"},{"key":"1173_CR13","doi-asserted-by":"crossref","unstructured":"Wang Z., Shaked O., Cassuto Y., Bruck J.: Codes for network switches. In: Proceedings IEEE International Symposium on Information Theory (ISIT), Istanbul, pp. 1057\u20131061 (2013).","DOI":"10.1109\/ISIT.2013.6620388"},{"issue":"4","key":"1173_CR14","doi-asserted-by":"publisher","first-page":"2061","DOI":"10.1109\/TIT.2017.2664867","volume":"63","author":"Z Wang","year":"2017","unstructured":"Wang Z., Kiah H.M., Cassuto Y., Bruck J.: Switch codes: codes for fully parallel reconstruction. IEEE Trans. Inform. Theory 63(4), 2061\u20132070 (2017).","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"10","key":"1173_CR15","doi-asserted-by":"publisher","first-page":"6434","DOI":"10.1109\/TIT.2022.3162158","volume":"68","author":"L Yohananov","year":"2022","unstructured":"Yohananov L., Yaakobi E.: Almost optimal construction of functional batch codes using extended Simplex codes. IEEE Trans. Inform. Theory 68(10), 6434\u20136451 (2022).","journal-title":"IEEE Trans. Inform. Theory"},{"key":"1173_CR16","doi-asserted-by":"crossref","unstructured":"Yohananov L., Yaakobi E.: Almost optimal construction of functional batch codes using Hadamard codes. In: Proceedings IEEE Symposium Information Theory (ISIT), Melbourne, pp. 3139\u20133144 (2021).","DOI":"10.1109\/ISIT45174.2021.9518215"},{"key":"1173_CR17","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/0012-365X(82)90028-0","volume":"1","author":"D Zeilberger","year":"1982","unstructured":"Zeilberger D.: A combinatorial proof of Dyson\u2019s conjecture. Discret. Math. 1, 317\u2013321 (1982).","journal-title":"Discret. Math."},{"key":"1173_CR18","doi-asserted-by":"crossref","unstructured":"Zhang Y., Yaakobi E., Etzion T.: Bounds on the length of functional PIR and batch codes. In: Proceedings IEEE International Symposium on Information Theory, Paris, pp. 2129\u20132133 (2019).","DOI":"10.1109\/ISIT.2019.8849453"},{"key":"1173_CR19","doi-asserted-by":"publisher","first-page":"4917","DOI":"10.1109\/TIT.2020.2977631","volume":"66","author":"Y Zhang","year":"2020","unstructured":"Zhang Y., Etzion T., Yaakobi E.: Bounds on the length of functional PIR and batch codes. IEEE Trans. Inform. Theory 66, 4917\u20134934 (2020).","journal-title":"IEEE Trans. Inform. Theory"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-022-01173-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-022-01173-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-022-01173-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,20]],"date-time":"2023-04-20T20:06:36Z","timestamp":1682021196000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-022-01173-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12,28]]},"references-count":19,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2023,5]]}},"alternative-id":["1173"],"URL":"https:\/\/doi.org\/10.1007\/s10623-022-01173-6","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,12,28]]},"assertion":[{"value":"14 October 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 July 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 December 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 December 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}