{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T15:45:22Z","timestamp":1780674322057,"version":"3.54.1"},"reference-count":45,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"7","license":[{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"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"}],"funder":[{"DOI":"10.13039\/501100005416","name":"Norges Forskningsr\u00e5d","doi-asserted-by":"publisher","award":["240985\/F20"],"award-info":[{"award-number":["240985\/F20"]}],"id":[{"id":"10.13039\/501100005416","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004359","name":"Vetenskapsr\u00e5det","doi-asserted-by":"publisher","award":["2016-04253"],"award-info":[{"award-number":["2016-04253"]}],"id":[{"id":"10.13039\/501100004359","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2019,7]]},"DOI":"10.1109\/tit.2019.2900313","type":"journal-article","created":{"date-parts":[[2019,2,19]],"date-time":"2019-02-19T19:29:16Z","timestamp":1550604556000},"page":"4243-4273","source":"Crossref","is-referenced-by-count":81,"title":["Achieving Maximum Distance Separable Private Information Retrieval Capacity With Linear Codes"],"prefix":"10.1109","volume":"65","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3610-6440","authenticated-orcid":false,"given":"Siddhartha","family":"Kumar","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8030-1919","authenticated-orcid":false,"given":"Hsuan-Yin","family":"Lin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8236-6601","authenticated-orcid":false,"given":"Eirik","family":"Rosnes","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5725-869X","authenticated-orcid":false,"given":"Alexandre","family":"Graell i Amat","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2054295"},{"key":"ref38","author":"huffman","year":"2010","journal-title":"Fundamentals of Error-Correcting Codes"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/18.133259"},{"key":"ref32","article-title":"t-private information retrieval schemes using transitive codes","author":"freij-hollanti","year":"0","journal-title":"IEEE Trans Inf Theory"},{"key":"ref31","author":"macwilliams","year":"1977","journal-title":"The Theory of Error-Correcting Codes"},{"key":"ref30","first-page":"1","article-title":"Reed-Muller codes for private information reterival","author":"freij-hollanti","year":"2017","journal-title":"Proc Workshop on Coding and Cryptography (WCC)"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/12.364531"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1016\/j.ffa.2005.05.007"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1954.1057465"},{"key":"ref34","author":"horn","year":"2013","journal-title":"Matrix Analysis"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2689028"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(70)90214-7"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2791994"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2815607"},{"key":"ref13","author":"zhang","year":"2017","journal-title":"A general private information retrieval scheme for MDS coded databases with colluding servers"},{"key":"ref14","author":"zhang","year":"2017","journal-title":"Private information retrieval from MDS coded databases with colluding servers under several variant models"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437805"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2779454"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2777490"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2017.8277997"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2878034"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006763"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/1326554.1326555"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2321280"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2002.1181949"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007396"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1137\/16M1102562"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536422"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282975"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6874954"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/293347.293350"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282977"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1995.492461"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2848977"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1049\/el:19930314"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2017.28"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2702660"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.820053"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.14778\/2535573.2488339"},{"key":"ref41","first-page":"543","article-title":"Array codes as low-density parity-check codes","author":"fan","year":"2000","journal-title":"Proc Int Symp Turbo Codes and Related Topics (ISTC)"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/NCA.2007.37"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2333519"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2329872"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2016.2539160"},{"key":"ref25","first-page":"1","article-title":"Erasure coding in Windows Azure storage","author":"huang","year":"2012","journal-title":"Proc USENIX Annu Tech Conf"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/8737030\/08643953.pdf?arnumber=8643953","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T21:13:36Z","timestamp":1657746816000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8643953\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7]]},"references-count":45,"journal-issue":{"issue":"7"},"URL":"https:\/\/doi.org\/10.1109\/tit.2019.2900313","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,7]]}}}