{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,17]],"date-time":"2026-07-17T15:11:46Z","timestamp":1784301106100,"version":"3.55.0"},"reference-count":44,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"11","license":[{"start":{"date-parts":[[2019,11,1]],"date-time":"2019-11-01T00:00:00Z","timestamp":1572566400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,11,1]],"date-time":"2019-11-01T00:00:00Z","timestamp":1572566400000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,11,1]],"date-time":"2019-11-01T00:00:00Z","timestamp":1572566400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,11,1]],"date-time":"2019-11-01T00:00:00Z","timestamp":1572566400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-18-32309"],"award-info":[{"award-number":["CCF-18-32309"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2019,11]]},"DOI":"10.1109\/tit.2019.2918207","type":"journal-article","created":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T20:39:40Z","timestamp":1558557580000},"page":"7613-7627","source":"Crossref","is-referenced-by-count":118,"title":["Capacity-Achieving Private Information Retrieval Codes With Optimal Message Size and Upload Cost"],"prefix":"10.1109","volume":"65","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8752-6141","authenticated-orcid":false,"given":"Chao","family":"Tian","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8777-7987","authenticated-orcid":false,"given":"Hua","family":"Sun","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8084-9332","authenticated-orcid":false,"given":"Jun","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2725272"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2599110"},{"key":"ref33","article-title":"An explicit, coupled-layer construction of a high-rate MSR code with low sub-packetization level, small field size and all-node repair","author":"sasidharan","year":"2016","journal-title":"arXiv 1607 07335"},{"key":"ref32","author":"lin","year":"2004","journal-title":"Error Control Coding"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2697422"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2697421"},{"key":"ref37","article-title":"A tight lower bound on the sub-packetization level of optimal-access MSR and MDS codes","author":"balaji","year":"2017","journal-title":"arXiv 1710 05876"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2855059"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2309000"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2730863"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6874954"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2800059"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282977"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2789426"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2779454"},{"key":"ref14","article-title":"Private information retrieval in distributed storage systems using an arbitrary linear code","author":"kumar","year":"2016","journal-title":"arXiv 1612 07084"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2869154"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2828310"},{"key":"ref17","article-title":"Asymmetry hurts: Private information retrieval under asymmetric traffic constraints","author":"banawan","year":"2018","journal-title":"arXiv 1801 03079"},{"key":"ref18","article-title":"Secure private information retrieval from colluding databases with eavesdroppers","author":"wang","year":"2017","journal-title":"arXiv 1710 01190"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437804"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746546"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2017.8262857"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/1326554.1326555"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2017.7997029"},{"key":"ref6","article-title":"PIR schemes with small download complexity and low storage requirements","author":"blackburn","year":"2016","journal-title":"arXiv 1609 07027"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24676-3_26"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282975"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1137\/16M1102562"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2815607"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2791994"},{"key":"ref9","article-title":"On private information retrieval array codes","author":"zhang","year":"2016","journal-title":"arXiv 1609 09167"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2689028"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006861"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437874"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2017.2725225"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2014.140516"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-63165-8_196"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2701807"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/293347.293350"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849542"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1137\/090772721"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.3390\/e20080603"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2002.1181949"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/18\/8876732\/8720234-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/8876732\/08720234.pdf?arnumber=8720234","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T21:09:17Z","timestamp":1657746557000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8720234\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11]]},"references-count":44,"journal-issue":{"issue":"11"},"URL":"https:\/\/doi.org\/10.1109\/tit.2019.2918207","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,11]]}}}