{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T05:00:19Z","timestamp":1773378019844,"version":"3.50.1"},"reference-count":28,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T00:00:00Z","timestamp":1626048000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T00:00:00Z","timestamp":1626048000000},"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":[[2021,7,12]]},"DOI":"10.1109\/isit45174.2021.9518246","type":"proceedings-article","created":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T16:52:42Z","timestamp":1630515162000},"page":"2990-2995","source":"Crossref","is-referenced-by-count":4,"title":["Wedge-Lifted Codes"],"prefix":"10.1109","author":[{"given":"Jabari","family":"Hastings","sequence":"first","affiliation":[{"name":"Stanford University"}]},{"given":"Amy","family":"Kanne","sequence":"additional","affiliation":[{"name":"Stanford University"}]},{"given":"Ray","family":"Li","sequence":"additional","affiliation":[{"name":"Stanford University"}]},{"given":"Mary","family":"Wootters","sequence":"additional","affiliation":[{"name":"Stanford University"}]}],"member":"263","reference":[{"key":"ref10","article-title":"Lifted multiplicity codes","author":"holzbaur","year":"2020","journal-title":"ArXiv Preprint"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007396"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/335305.335315"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897523"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/2629416"},{"key":"ref15","first-page":"38:1","article-title":"Lifted Multiplicity Codes and the Disjoint Repair Group Property","author":"li","year":"2019","journal-title":"Approximation Randomization and Combinatorial Optimization Algorithms and Techniques (APPROX\/RANDOM 2019) volume 145 of Leibniz International Proceedings in Informatics (LIPIcs)"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/REDUNDANCY48165.2019.9003339"},{"key":"ref17","article-title":"Lower bound on the redundancy of PIR codes","author":"rao","year":"2016","journal-title":"ArXiv Preprint"},{"key":"ref18","article-title":"A solution to the network challenges of data recovery in erasure-coded distributed storage systems: A study on the facebook warehouse cluster","author":"kv","year":"0","journal-title":"5th USENIX Workshop on Hot Topics in Storage and File Systems"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6874919"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2015.7447047"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282977"},{"key":"ref27","article-title":"Linear codes with disjoint repair groups","author":"wootters","year":"2016","journal-title":"Not intended for publication"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1137\/090772721"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/2422436.2422494"},{"key":"ref5","article-title":"Locality via partially lifted codes","author":"frank-fischer","year":"2017","journal-title":"Randomization, Approximation, and Combinatorial Optimization. Algorithms and Techniques"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2014.12.013"},{"key":"ref7","article-title":"Wedge-lifted codes","author":"hastings","year":"2020","journal-title":"ArXiv Preprint"},{"key":"ref2","article-title":"PIR Array Codes with Optimal PIR Rate","author":"blackburn","year":"2016","journal-title":"ArXiv e-prints"},{"key":"ref9","first-page":"634","author":"holzbaur","year":"2020","journal-title":"Lifted reed-solomon codes with application to batch codes"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2852294"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2524007"},{"key":"ref22","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-76878-4","volume":"254","author":"stichtenoth","year":"2009","journal-title":"Algebraic Function Fields and Codes"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-70293-3_16"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2518663"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6874921"},{"key":"ref26","first-page":"766","author":"woodruff","year":"2010","journal-title":"A Quadratic Lower Bound for Three-Query Linear Locally Decodable Codes over Any Field"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2351404"}],"event":{"name":"2021 IEEE International Symposium on Information Theory (ISIT)","location":"Melbourne, Australia","start":{"date-parts":[[2021,7,12]]},"end":{"date-parts":[[2021,7,20]]}},"container-title":["2021 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9517708\/9517709\/09518246.pdf?arnumber=9518246","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:35:56Z","timestamp":1773347756000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9518246\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,12]]},"references-count":28,"URL":"https:\/\/doi.org\/10.1109\/isit45174.2021.9518246","relation":{},"subject":[],"published":{"date-parts":[[2021,7,12]]}}}