{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T05:01:46Z","timestamp":1773378106134,"version":"3.50.1"},"reference-count":23,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T00:00:00Z","timestamp":1656201600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T00:00:00Z","timestamp":1656201600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,6,26]]},"DOI":"10.1109\/isit50566.2022.9834625","type":"proceedings-article","created":{"date-parts":[[2022,8,3]],"date-time":"2022-08-03T15:34:22Z","timestamp":1659540862000},"page":"1596-1599","source":"Crossref","is-referenced-by-count":2,"title":["Improved batch code lower bounds"],"prefix":"10.1109","author":[{"given":"Ray","family":"Li","sequence":"first","affiliation":[{"name":"Stanford University,Department of Computer Science"}]},{"given":"Mary","family":"Wootters","sequence":"additional","affiliation":[{"name":"Stanford University,Department of Computer Science"}]}],"member":"263","reference":[{"key":"ref10","article-title":"Lower bounds on the redundancy of linear codes with disjoint repair groups","author":"rao","year":"2022","journal-title":"2022 IEEE International Symposium on Information Theory (ISIT)"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282977"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2246813"},{"key":"ref13","article-title":"Locality via partially lifted codes","author":"frank-fischer","year":"2017","journal-title":"Approximation Randomization and Combinatorial Optimization Algorithms and Techniques"},{"key":"ref14","first-page":"38:1","article-title":"Lifted Multiplicity Codes and the Disjoint Repair Group Property","volume":"145","author":"li","year":"2019","journal-title":"Randomization, Approximation, and Combinatorial Optimization. Algorithms and Techniques"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9518246"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2208937"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6874919"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541487"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620388"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541488"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-17296-5_26"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849736"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2852294"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174402"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3013603"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2524007"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007396"},{"key":"ref9","article-title":"Lifted multiplicity codes","author":"holzbaur","year":"2020"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282532"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.3934\/amc.2009.3.13"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282453"},{"key":"ref23","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1007\/978-3-319-70293-3_16","article-title":"Batch and PIR codes and their connections to locally repairable codes","author":"skachek","year":"2018","journal-title":"Network Coding and Subspace Designs"}],"event":{"name":"2022 IEEE International Symposium on Information Theory (ISIT)","location":"Espoo, Finland","start":{"date-parts":[[2022,6,26]]},"end":{"date-parts":[[2022,7,1]]}},"container-title":["2022 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9834325\/9834269\/09834625.pdf?arnumber=9834625","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:36:19Z","timestamp":1773347779000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9834625\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,26]]},"references-count":23,"URL":"https:\/\/doi.org\/10.1109\/isit50566.2022.9834625","relation":{},"subject":[],"published":{"date-parts":[[2022,6,26]]}}}