{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:52:38Z","timestamp":1773377558269,"version":"3.50.1"},"reference-count":30,"publisher":"IEEE","license":[{"start":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T00:00:00Z","timestamp":1590969600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T00:00:00Z","timestamp":1590969600000},"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":[[2020,6]]},"DOI":"10.1109\/isit44484.2020.9174459","type":"proceedings-article","created":{"date-parts":[[2020,8,24]],"date-time":"2020-08-24T17:28:01Z","timestamp":1598290081000},"page":"1024-1029","source":"Crossref","is-referenced-by-count":3,"title":["Array Codes for Functional PIR and Batch Codes"],"prefix":"10.1109","author":[{"given":"Mohammad","family":"Nassar","sequence":"first","affiliation":[{"name":"Technion — Israel Institute of Technology,Haifa,Israel,3200003"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eitan","family":"Yaakobi","sequence":"additional","affiliation":[{"name":"Technion — Israel Institute of Technology,Haifa,Israel,3200003"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849453"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/2968443"},{"key":"ref11","article-title":"PIR with low storage overhead: coding instead of replication","author":"fazeli","year":"2015"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007396"},{"key":"ref13","author":"lin","year":"2004","journal-title":"Error Control Coding"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-17296-5_26"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.21236\/AD0407946"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174459"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620355"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6874919"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2524007"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541487"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2920975"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/1721654.1721674"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8007011"},{"key":"ref6","first-page":"1062","article-title":"A generalization of Blackburn-Etzion construction for PIR array codes","author":"chee","year":"2019","journal-title":"Proc IEEE Int Symp on Inf Theory"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2728791"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2920635"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282453"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/293347.293350"},{"key":"ref2","first-page":"261","article-title":"Breaking the O(n1\/(2k-1)) barrier for information theoretic private information retrieval","author":"beimel","year":"2002","journal-title":"Proc of the 43rd Symposium on Foundations of Computer Science"},{"key":"ref9","author":"cohen","year":"1997","journal-title":"Covering Codes"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006508"},{"key":"ref20","article-title":"Coding scheme for optimizing random I\/O performance","author":"sharon","year":"2013","journal-title":"Non-Volatile Memories Workshop"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541488"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2321280"},{"key":"ref24","article-title":"A survey on private information retrieval","author":"william","year":"2004","journal-title":"Bulletin of the EATCS"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2664867"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2017.8277956"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2016.2538219"}],"event":{"name":"2020 IEEE International Symposium on Information Theory (ISIT)","location":"Los Angeles, CA, USA","start":{"date-parts":[[2020,6,21]]},"end":{"date-parts":[[2020,6,26]]}},"container-title":["2020 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9166581\/9173928\/09174459.pdf?arnumber=9174459","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:34:22Z","timestamp":1773347662000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9174459\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6]]},"references-count":30,"URL":"https:\/\/doi.org\/10.1109\/isit44484.2020.9174459","relation":{},"subject":[],"published":{"date-parts":[[2020,6]]}}}