{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T12:22:35Z","timestamp":1777724555456,"version":"3.51.4"},"reference-count":9,"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.8849542","type":"proceedings-article","created":{"date-parts":[[2019,9,26]],"date-time":"2019-09-26T21:46:12Z","timestamp":1569534372000},"page":"370-374","source":"Crossref","is-referenced-by-count":16,"title":["Capacity-Achieving Private Information Retrieval Codes from MDS-Coded Databases with Minimum Message Size"],"prefix":"10.1109","author":[{"given":"Ruida","family":"Zhou","sequence":"first","affiliation":[{"name":"Department of Electrical and Computer Engineering, Texas A&M University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chao","family":"Tian","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, Texas A&M University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tie","family":"Liu","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, Texas A&M University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hua","family":"Sun","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, Texas A&M University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2791994"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6874954"},{"key":"ref6","doi-asserted-by":"crossref","first-page":"100 306:1","DOI":"10.1007\/s11432-018-9538-4","article-title":"On sub-packetization and access number of capacity-achieving PIR schemes for MDS coded non-colluding databases","volume":"61","author":"xu","year":"2018","journal-title":"Science China Information Sciences"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2815607"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.3390\/e20080603"},{"key":"ref7","article-title":"Capacity-achieving private information retrieval codes with optimal message size and upload cost","author":"tian","year":"2018"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2689028"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849542"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/293347.293350"}],"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\/08849542.pdf?arnumber=8849542","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:34:08Z","timestamp":1773347648000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8849542\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7]]},"references-count":9,"URL":"https:\/\/doi.org\/10.1109\/isit.2019.8849542","relation":{},"subject":[],"published":{"date-parts":[[2019,7]]}}}