{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:37:27Z","timestamp":1773376647740,"version":"3.50.1"},"reference-count":60,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,6,25]],"date-time":"2023-06-25T00:00:00Z","timestamp":1687651200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,6,25]],"date-time":"2023-06-25T00:00:00Z","timestamp":1687651200000},"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","id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,6,25]]},"DOI":"10.1109\/isit54713.2023.10206655","type":"proceedings-article","created":{"date-parts":[[2023,8,22]],"date-time":"2023-08-22T13:31:15Z","timestamp":1692711075000},"page":"2714-2719","source":"Crossref","is-referenced-by-count":2,"title":["Computationally Relaxed Locally Decodable Codes, Revisited"],"prefix":"10.1109","author":[{"given":"Alexander R.","family":"Block","sequence":"first","affiliation":[{"name":"Georgetown University and University of Maryland,College Park"}]},{"given":"Jeremiah","family":"Blocki","sequence":"additional","affiliation":[{"name":"Purdue University"}]}],"member":"263","reference":[{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3076396"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-78375-8_4"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539705446810"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3134031"},{"key":"ref15","article-title":"Binary codes capable of correcting deletions, insertions and reversals","volume":"10","author":"levenshtein","year":"1966","journal-title":"Soviet Physics Doklady"},{"key":"ref59","article-title":"Exponential lower bounds for locally decodable and correctable codes for insertions and deletions","author":"blocki","year":"2021","journal-title":"FOCS"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-57785-8_183"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-15982-4_8"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-22935-0_51"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85174-5_8"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s11390-012-1254-8"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1016\/0898-1221(75)90037-1"},{"key":"ref10","article-title":"New lower bounds for general locally decodable codes","volume":"tr07 6","author":"woodruff","year":"2007","journal-title":"Electronic Colloq on Comp Compl"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2020.v016a018"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2659765"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24698-5_34"},{"key":"ref19","article-title":"Synchronization strings: List decoding for insertions and deletions","volume":"107","author":"haeupler","year":"2018","journal-title":"ICALP"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2746566"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-73420-8_35"},{"key":"ref50","first-page":"16:1","article-title":"On locally decodable codes in resource bounded channels","volume":"163","author":"blocki","year":"0"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/SURV.2010.020110.00079"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-69903-3_1"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1145\/2936015"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30576-7_1"},{"key":"ref42","article-title":"Constructing digital signatures from a one way function","author":"lamport","year":"1979","journal-title":"Tech Rep"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-07085-3_21"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1515\/9783110198119.273"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/18.796406"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-020-00203-w"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/2993749.2993761"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1561\/0400000030"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/3051093"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/1326554.1326555"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2004.04.007"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1137\/090772721"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1137\/100804322"},{"key":"ref40","article-title":"Efficient identification and signatures for smart cards","volume":"435","author":"schnorr","year":"1989","journal-title":"Crypto"},{"key":"ref35","article-title":"Locally decodable\/correctable codes for insertions and deletions","volume":"182","author":"block","year":"2020","journal-title":"FSTTCS"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-17470-9_14"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9518249"},{"key":"ref36","article-title":"Locally decodable codes with randomized encoding","author":"cheng","year":"2020","journal-title":"IACR Cryptol ePrint Arch"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/3468265"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3120910"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/3561046"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3028702"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.2000.1730"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/335305.335315"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1972.1054893"},{"key":"ref38","article-title":"Generalized minimum distance decoding","volume":"12","author":"f","year":"1966","journal-title":"IEEE Trans Inf Theory"},{"key":"ref24","article-title":"Near-linear time insertion-deletion codes and (1+?)-approximating edit distance via indexing","author":"haeupler","year":"2019","journal-title":"STOC"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2876861"},{"key":"ref26","article-title":"On list decoding of insertion and deletion errors","author":"liu","year":"2019","journal-title":"CoRR"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2019.00029"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/3188745.3188940"},{"key":"ref22","article-title":"Block edit errors with transpositions: Deterministic document exchange protocols and almost optimal binary codes","volume":"132","author":"cheng","year":"2019","journal-title":"ICALP"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975482.132"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2968298"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976465.1"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976465.144"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT54713.2023.10206655"}],"event":{"name":"2023 IEEE International Symposium on Information Theory (ISIT)","location":"Taipei, Taiwan","start":{"date-parts":[[2023,6,25]]},"end":{"date-parts":[[2023,6,30]]}},"container-title":["2023 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10206429\/10206441\/10206655.pdf?arnumber=10206655","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:27:17Z","timestamp":1773347237000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10206655\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,25]]},"references-count":60,"URL":"https:\/\/doi.org\/10.1109\/isit54713.2023.10206655","relation":{},"subject":[],"published":{"date-parts":[[2023,6,25]]}}}