{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T09:55:16Z","timestamp":1740131716443,"version":"3.37.3"},"reference-count":41,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"10","license":[{"start":{"date-parts":[[2024,10,1]],"date-time":"2024-10-01T00:00:00Z","timestamp":1727740800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,10,1]],"date-time":"2024-10-01T00:00:00Z","timestamp":1727740800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,10,1]],"date-time":"2024-10-01T00:00:00Z","timestamp":1727740800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["852953"],"award-info":[{"award-number":["852953"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["1789\/23"],"award-info":[{"award-number":["1789\/23"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2024,10]]},"DOI":"10.1109\/tit.2024.3396498","type":"journal-article","created":{"date-parts":[[2024,5,3]],"date-time":"2024-05-03T18:33:23Z","timestamp":1714761203000},"page":"6857-6876","source":"Crossref","is-referenced-by-count":1,"title":["Bounds and Constructions for Generalized Batch Codes"],"prefix":"10.1109","volume":"70","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7893-2276","authenticated-orcid":false,"given":"Xiangliang","family":"Kong","sequence":"first","affiliation":[{"name":"Department of Electrical Engineering-Systems, Tel Aviv University, Tel Aviv-Yafo, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8551-1592","authenticated-orcid":false,"given":"Ohad","family":"Elishco","sequence":"additional","affiliation":[{"name":"School of Electrical and Computer Engineering, Ben-Gurion University of the Negev, Be’er Sheva, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007396"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/tit.2014.2321280"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2351404"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282780"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2524510"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2518663"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2944397"},{"key":"ref8","article-title":"PIR with low storage overhead: Coding instead of replication","author":"Fazeli","year":"2015","journal-title":"arXiv:1505.06241"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.3934\/amc.2009.3.13"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.3934\/amc.2012.6.165"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-014-0007-9"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1137\/19M1248108"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3029720"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620388"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282532"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282453"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2728791"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2977631"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9518215"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/tit.2016.2524007"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541488"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT50566.2022.9834487"},{"key":"ref23","article-title":"Improved batch code lower bounds","author":"Li","year":"2021","journal-title":"arXiv:2106.02163"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2852294"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3013603"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3116520"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8007009"},{"key":"ref28","first-page":"43:1","article-title":"Locality via partially lifted codes","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX\/RANDOM 2023)","volume":"81","author":"Frank-Fischer","year":"2017"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3034962"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/REDUNDANCY48165.2019.9003339"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/isit45174.2021.9518246"},{"key":"ref32","article-title":"Lengthening and extending binary private information retrieval codes","author":"Lin","year":"2017","journal-title":"arXiv:1707.03495"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-020-00828-6"},{"key":"ref34","first-page":"145","article-title":"Revisiting a lower bound on the redundancy of linear batch codes","volume-title":"Electron. Colloq. Comput. Complex.","author":"Alrabiah","year":"2021"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-3886-0"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17364-6"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/2422436.2422494"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2017.8277956"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2664867"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781316414958"},{"volume-title":"Probability and Computing: Randomization and Probabilistic Techniques in Algorithms and Data Analysis","year":"2017","author":"Mitzenmacher","key":"ref41"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/10682502\/10517991.pdf?arnumber=10517991","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,18]],"date-time":"2024-09-18T17:54:39Z","timestamp":1726682079000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10517991\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10]]},"references-count":41,"journal-issue":{"issue":"10"},"URL":"https:\/\/doi.org\/10.1109\/tit.2024.3396498","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"type":"print","value":"0018-9448"},{"type":"electronic","value":"1557-9654"}],"subject":[],"published":{"date-parts":[[2024,10]]}}}