{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T08:13:08Z","timestamp":1761293588803,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":39,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,6,19]],"date-time":"2017-06-19T00:00:00Z","timestamp":1497830400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1527110 and CCF-1618280"],"award-info":[{"award-number":["CCF-1527110 and CCF-1618280"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,6,19]]},"DOI":"10.1145\/3055399.3055498","type":"proceedings-article","created":{"date-parts":[[2017,6,15]],"date-time":"2017-06-15T20:27:45Z","timestamp":1497558465000},"page":"33-46","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":42,"title":["Synchronization strings"],"prefix":"10.1145","author":[{"given":"Bernhard","family":"Haeupler","sequence":"first","affiliation":[{"name":"Carnegie Mellon University, USA"}]},{"given":"Amirbehshad","family":"Shahrasbi","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, USA"}]}],"member":"320","published-online":{"date-parts":[[2017,6,19]]},"reference":[{"key":"e_1_3_2_2_1_1","unstructured":"Arturs Backurs and Piotr Indyk. 2015. Arturs Backurs and Piotr Indyk. 2015."},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746612"},{"volume-title":"Proceedings of the International Conference on Automata, Languages, and Programming (ICALP) 55","year":"2016","author":"Braverman Mark","key":"e_1_3_2_2_3_1"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1137\/100799642"},{"key":"e_1_3_2_2_5_1","unstructured":"Ran Gelles. 2015. Coding for Interactive Communication: A Survey. (2015). Ran Gelles. 2015. Coding for Interactive Communication: A Survey. (2015)."},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/2722129.2722215"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2014.49"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591872"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1963.1088781"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.855587"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541373"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"crossref","unstructured":"Venkatesan Guruswami and Ray Li. 2016. Efficiently decodable insertion\/deletion codes for high-noise and high-rate regimes. arXiv:1605.04611 (2016). Venkatesan Guruswami and Ray Li. 2016. Efficiently decodable insertion\/deletion codes for high-noise and high-rate regimes. arXiv:1605.04611 (2016).","DOI":"10.1109\/ISIT.2016.7541373"},{"key":"e_1_3_2_2_13_1","unstructured":"Venkatesan Guruswami and Atri Rudra. 2008. Venkatesan Guruswami and Atri Rudra. 2008."},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.911222"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/2833227.2833229"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2659765"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2371819"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2014.32"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2049697.2049702"},{"key":"e_1_3_2_2_20_1","unstructured":"Bernhard Haeupler and Amirbehshad Shahrasbi. 2017. Bernhard Haeupler and Amirbehshad Shahrasbi. 2017."},{"key":"e_1_3_2_2_21_1","unstructured":"Synchronization Strings: Codes for Insertions and Deletions Approaching the Singleton Bound. arXiv:1704.00807 (2017). Synchronization Strings: Codes for Insertions and Deletions Approaching the Singleton Bound. arXiv:1704.00807 (2017)."},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"crossref","DOI":"10.1145\/3055399.3055498","volume-title":"Synchronization Strings: Explicit Constructions, Local Decoding and Applications.","author":"Haeupler Bernhard","year":"2017"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"crossref","DOI":"10.1145\/3055399.3055498","volume-title":"Synchronization Strings: Channel Simulations and Interactive Coding for Insertions and Deletions.","author":"Haeupler Bernhard","year":"2017"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488699"},{"key":"e_1_3_2_2_25_1","unstructured":"Vladimir I Levenshtein. 1965. Vladimir I Levenshtein. 1965."},{"key":"e_1_3_2_2_26_1","unstructured":"Binary codes capable of correcting deletions insertions and reversals. Doklady Akademii Nauk SSSR 163 4 (1965) 845\u2013848. Binary codes capable of correcting deletions insertions and reversals. Doklady Akademii Nauk SSSR 163 4 (1965) 845\u2013848."},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.807285"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.5555\/645413.652135"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/SURV.2010.020110.00079"},{"key":"e_1_3_2_2_30_1","unstructured":"Michael Mitzenmacher. 2009. Michael Mitzenmacher. 2009."},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"crossref","unstructured":"A survey of results for deletion channels and related synchronization channels. Probability Surveys 6 (2009) 1\u201333. A survey of results for deletion channels and related synchronization channels. Probability Surveys 6 (2009) 1\u201333.","DOI":"10.1214\/08-PS141"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1667053.1667060"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1137\/0222053"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.796406"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"crossref","unstructured":"Neil JA Sloane. 2002. On single-deletion-correcting codes. Codes and Designs de Gruyter Berlin (2002) 273\u2013291. Neil JA Sloane. 2002. On single-deletion-correcting codes. Codes and Designs de Gruyter Berlin (2002) 273\u2013291.","DOI":"10.1515\/9783110198119.273"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.556668"},{"key":"e_1_3_2_2_37_1","unstructured":"A Thue. 1977. Uber die gegenseitige Lage gleicher Teile gewisser Zeichenreihen (1912). A Thue. 1977. Uber die gegenseitige Lage gleicher Teile gewisser Zeichenreihen (1912)."},{"key":"e_1_3_2_2_38_1","unstructured":"Selected mathematical papers of Axel Thue Universitetsforlaget (1977). Selected mathematical papers of Axel Thue Universitetsforlaget (1977)."},{"key":"e_1_3_2_2_39_1","unstructured":"Michael Tsfasman and Serge G Vladut. 2013. Michael Tsfasman and Serge G Vladut. 2013."}],"event":{"name":"STOC '17: Symposium on Theory of Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Montreal Canada","acronym":"STOC '17"},"container-title":["Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3055399.3055498","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3055399.3055498","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3055399.3055498","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:36:20Z","timestamp":1750217780000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3055399.3055498"}},"subtitle":["codes for insertions and deletions approaching the Singleton bound"],"short-title":[],"issued":{"date-parts":[[2017,6,19]]},"references-count":39,"alternative-id":["10.1145\/3055399.3055498","10.1145\/3055399"],"URL":"https:\/\/doi.org\/10.1145\/3055399.3055498","relation":{},"subject":[],"published":{"date-parts":[[2017,6,19]]},"assertion":[{"value":"2017-06-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}