{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:56:39Z","timestamp":1773377799012,"version":"3.50.1"},"reference-count":11,"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.8849373","type":"proceedings-article","created":{"date-parts":[[2019,9,26]],"date-time":"2019-09-26T21:46:12Z","timestamp":1569534372000},"page":"1062-1066","source":"Crossref","is-referenced-by-count":5,"title":["A Generalization of the Blackburn-Etzion Construction for Private Information Retrieval Array Codes"],"prefix":"10.1109","author":[{"given":"Yeow Meng","family":"Chee","sequence":"first","affiliation":[{"name":"Department of Industrial Systems Engineering and Management, National University of Singapore, Singapore"}]},{"given":"Han","family":"Mao Kiah","sequence":"additional","affiliation":[{"name":"School of Physical and Mathematical Sciences, Nanyang Technological University, Singapore"}]},{"given":"Eitan","family":"Yaakobi","sequence":"additional","affiliation":[{"name":"Computer Science Department, Technion—Israel Institute of Technology, Haifa, Israel"}]},{"given":"Hui","family":"Zhang","sequence":"additional","affiliation":[{"name":"School of Physical and Mathematical Sciences, Nanyang Technological University, Singapore"}]}],"member":"263","reference":[{"key":"ref4","article-title":"PIR array codes with optimal virtual server rate","author":"blackburn","year":"2018","journal-title":"arXiv 1607 00235v6"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8007011"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-70293-3_16"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282977"},{"key":"ref11","article-title":"On private information retrieval array codes","author":"zhang","year":"2016","journal-title":"arXiv 1609 09167"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/293347.293350"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1112\/jlms\/s1-10.37.26"},{"key":"ref7","article-title":"PIR with low storage overhead: coding instead of replication","author":"fazeli","year":"2015","journal-title":"arXiv 1505 06241"},{"key":"ref2","first-page":"91","article-title":"On the factorization of the complete uniform hypergraph","author":"baranyai","year":"1975","journal-title":"Infinite and Finite Sets"},{"key":"ref9","article-title":"Lower bound on the redundancy of PIR codes","author":"rao","year":"2017","journal-title":"arxiv 1605 01869vl"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2852294"}],"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\/08849373.pdf?arnumber=8849373","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:35:11Z","timestamp":1773347711000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8849373\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7]]},"references-count":11,"URL":"https:\/\/doi.org\/10.1109\/isit.2019.8849373","relation":{},"subject":[],"published":{"date-parts":[[2019,7]]}}}