{"id":"https://openalex.org/W2742656286","doi":"https://doi.org/10.1109/isit.2017.8007016","title":"Asymptotically optimal sticky-insertion-correcting codes with efficient encoding and decoding","display_name":"Asymptotically optimal sticky-insertion-correcting codes with efficient encoding and decoding","publication_year":2017,"publication_date":"2017-06-01","ids":{"openalex":"https://openalex.org/W2742656286","doi":"https://doi.org/10.1109/isit.2017.8007016","mag":"2742656286"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2017.8007016","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2017.8007016","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5056299839","display_name":"Hessam Mahdavifar","orcid":"https://orcid.org/0000-0001-9021-1992"},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan\u2013Ann Arbor","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]},{"id":"https://openalex.org/I36258959","display_name":"University of California, San Diego","ror":"https://ror.org/0168r3w48","country_code":"US","type":"education","lineage":["https://openalex.org/I36258959"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Hessam Mahdavifar","raw_affiliation_strings":["University of Michigan Ann Arbor, University of California, San Diego"],"affiliations":[{"raw_affiliation_string":"University of Michigan Ann Arbor, University of California, San Diego","institution_ids":["https://openalex.org/I27837315","https://openalex.org/I36258959"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5004102644","display_name":"Alexander Vardy","orcid":"https://orcid.org/0000-0003-3303-9078"},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan\u2013Ann Arbor","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]},{"id":"https://openalex.org/I36258959","display_name":"University of California, San Diego","ror":"https://ror.org/0168r3w48","country_code":"US","type":"education","lineage":["https://openalex.org/I36258959"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Alexander Vardy","raw_affiliation_strings":["University of Michigan Ann Arbor, University of California, San Diego"],"affiliations":[{"raw_affiliation_string":"University of Michigan Ann Arbor, University of California, San Diego","institution_ids":["https://openalex.org/I27837315","https://openalex.org/I36258959"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5056299839"],"corresponding_institution_ids":["https://openalex.org/I27837315","https://openalex.org/I36258959"],"apc_list":null,"apc_paid":null,"fwci":2.3402,"has_fulltext":false,"cited_by_count":33,"citation_normalized_percentile":{"value":0.91197197,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/bch-code","display_name":"BCH code","score":0.7012062072753906},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.6987324953079224},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.6260955929756165},{"id":"https://openalex.org/keywords/redundancy","display_name":"Redundancy (engineering)","score":0.6054412126541138},{"id":"https://openalex.org/keywords/encoding","display_name":"Encoding (memory)","score":0.5659545660018921},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.49497097730636597},{"id":"https://openalex.org/keywords/asymptotically-optimal-algorithm","display_name":"Asymptotically optimal algorithm","score":0.4721519947052002},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4647212624549866},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4458480775356293},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4434434175491333},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4133157432079315},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3736329674720764}],"concepts":[{"id":"https://openalex.org/C42276685","wikidata":"https://www.wikidata.org/wiki/Q795705","display_name":"BCH code","level":3,"score":0.7012062072753906},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.6987324953079224},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.6260955929756165},{"id":"https://openalex.org/C152124472","wikidata":"https://www.wikidata.org/wiki/Q1204361","display_name":"Redundancy (engineering)","level":2,"score":0.6054412126541138},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.5659545660018921},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.49497097730636597},{"id":"https://openalex.org/C181789720","wikidata":"https://www.wikidata.org/wiki/Q4812191","display_name":"Asymptotically optimal algorithm","level":2,"score":0.4721519947052002},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4647212624549866},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4458480775356293},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4434434175491333},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4133157432079315},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3736329674720764},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2017.8007016","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2017.8007016","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1651322423","https://openalex.org/W1981443800","https://openalex.org/W2065494245","https://openalex.org/W2082173153","https://openalex.org/W2121567355","https://openalex.org/W2125636047","https://openalex.org/W2132083478","https://openalex.org/W2163962630","https://openalex.org/W2581797122","https://openalex.org/W2601746657","https://openalex.org/W4205550388"],"related_works":["https://openalex.org/W2063367080","https://openalex.org/W2351328516","https://openalex.org/W2089096085","https://openalex.org/W4220913346","https://openalex.org/W2366500143","https://openalex.org/W2101825978","https://openalex.org/W2148416263","https://openalex.org/W2035701639","https://openalex.org/W2367155214","https://openalex.org/W1999812486"],"abstract_inverted_index":{"The":[0],"problem":[1],"of":[2,20,23,30,71,74,98],"constructing":[3],"sticky-insertion-correcting":[4,17],"codes":[5,42,55],"with":[6],"efficient":[7],"encoding":[8],"and":[9,43,53],"decoding":[10],"is":[11,66],"considered.":[12],"An":[13],"{n,":[14],"M,":[15],"r)":[16],"code":[18],"consists":[19],"M":[21],"codewords":[22],"length":[24,91],"n":[25],"such":[26],"that":[27,56,68],"any":[28],"pattern":[29],"up":[31,60],"to":[32,50,59,61,81],"r":[33,62],"sticky":[34,63],"insertions":[35],"can":[36],"be":[37],"corrected.":[38],"We":[39],"utilize":[40],"BCH":[41],"their":[44],"analogous":[45],"in":[46,78],"the":[47,69,72,79,89,99],"Lee":[48],"space":[49],"construct":[51],"explicit":[52],"systematic":[54],"are":[57],"immune":[58],"insertions.":[64],"It":[65],"shown":[67],"ratio":[70],"number":[73],"constructed":[75],"redundancy":[76],"bits":[77],"construction":[80],"a":[82],"certain":[83],"upper":[84],"bound":[85],"approaches":[86],"one":[87],"as":[88],"block":[90],"grows":[92],"large,":[93],"which":[94],"implies":[95],"asymptotic":[96],"optimality":[97],"construction.":[100]},"counts_by_year":[{"year":2024,"cited_by_count":7},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}