{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:53:06Z","timestamp":1773377586568,"version":"3.50.1"},"reference-count":16,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"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":[[2019,7]]},"DOI":"10.1109\/isit.2019.8849453","type":"proceedings-article","created":{"date-parts":[[2019,9,26]],"date-time":"2019-09-26T21:46:12Z","timestamp":1569534372000},"page":"2129-2133","source":"Crossref","is-referenced-by-count":7,"title":["Bounds on the Length of Functional PIR and Batch Codes"],"prefix":"10.1109","author":[{"given":"Yiwei","family":"Zhang","sequence":"first","affiliation":[{"name":"Dept. of Computer Science, Technion-Israel Inst. of Technology, Haifa, 3200003, Israel"}]},{"given":"Eitan","family":"Yaakobi","sequence":"additional","affiliation":[{"name":"Dept. of Computer Science, Technion-Israel Inst. of Technology, Haifa, 3200003, Israel"}]},{"given":"Tuvi","family":"Etzion","sequence":"additional","affiliation":[{"name":"Dept. of Computer Science, Technion-Israel Inst. of Technology, Haifa, 3200003, Israel"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2524510"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2524007"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6874954"},{"key":"ref13","article-title":"Coding scheme for optimizing random I\/O performance","author":"sharon","year":"2013","journal-title":"Non-Volatile Memories Workshop"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2016.2538219"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2017.8277956"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849453"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1986.1057221"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/293347.293350"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1098-2418(200003)16:2<209::AID-RSA6>3.0.CO;2-1"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1985.1057043"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(87)90055-0"},{"key":"ref7","article-title":"Private information retrieval without storage overhead: coding instead of replication","author":"fazeli","year":"2015","journal-title":"arxiv org\/abs\/1505 0624"},{"key":"ref2","first-page":"99","article-title":"Asymptotically exact uniform bounds for spectra of cosets of linear codes","volume":"26","author":"blinovskii","year":"1990","journal-title":"Problemy Peredachi Informatsii"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2852294"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007396"}],"event":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","location":"Paris, France","start":{"date-parts":[[2019,7,7]]},"end":{"date-parts":[[2019,7,12]]}},"container-title":["2019 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8827389\/8849208\/08849453.pdf?arnumber=8849453","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:34:29Z","timestamp":1773347669000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8849453\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/isit.2019.8849453","relation":{},"subject":[],"published":{"date-parts":[[2019,7]]}}}