{"id":"https://openalex.org/W2725712048","doi":"https://doi.org/10.1109/isit.2017.8007019","title":"On unique decoding from insertion errors","display_name":"On unique decoding from insertion errors","publication_year":2017,"publication_date":"2017-06-01","ids":{"openalex":"https://openalex.org/W2725712048","doi":"https://doi.org/10.1109/isit.2017.8007019","mag":"2725712048"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2017.8007019","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2017.8007019","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/A5027465180","display_name":"Kayvon Mazooji","orcid":"https://orcid.org/0000-0001-6926-1071"},"institutions":[{"id":"https://openalex.org/I2799798094","display_name":"UCLA Health","ror":"https://ror.org/01d88se56","country_code":"US","type":"funder","lineage":["https://openalex.org/I2799798094"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Kayvon Mazooji","raw_affiliation_strings":["UCLA, Los Angeles, CA"],"affiliations":[{"raw_affiliation_string":"UCLA, Los Angeles, CA","institution_ids":["https://openalex.org/I2799798094"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5027465180"],"corresponding_institution_ids":["https://openalex.org/I2799798094"],"apc_list":null,"apc_paid":null,"fwci":0.2519,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.55846444,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":"5","issue":null,"first_page":"2698","last_page":"2702"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":1.0,"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"}},"topics":[{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":1.0,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9991999864578247,"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/T12162","display_name":"Cellular Automata and Applications","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/decoding-methods","display_name":"Decoding methods","score":0.8706651926040649},{"id":"https://openalex.org/keywords/code-word","display_name":"Code word","score":0.7796932458877563},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.6088598370552063},{"id":"https://openalex.org/keywords/limiting","display_name":"Limiting","score":0.5749427676200867},{"id":"https://openalex.org/keywords/levenshtein-distance","display_name":"Levenshtein distance","score":0.5561563968658447},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5388628244400024},{"id":"https://openalex.org/keywords/sequential-decoding","display_name":"Sequential decoding","score":0.5284897089004517},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5208433270454407},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.507087230682373},{"id":"https://openalex.org/keywords/word","display_name":"Word (group theory)","score":0.5019192695617676},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.501579761505127},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4437513053417206},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4195364713668823},{"id":"https://openalex.org/keywords/hamming-distance","display_name":"Hamming distance","score":0.4182875156402588},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3867279589176178},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.14274129271507263},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.11564180254936218}],"concepts":[{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.8706651926040649},{"id":"https://openalex.org/C153207627","wikidata":"https://www.wikidata.org/wiki/Q863873","display_name":"Code word","level":3,"score":0.7796932458877563},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.6088598370552063},{"id":"https://openalex.org/C188198153","wikidata":"https://www.wikidata.org/wiki/Q1613840","display_name":"Limiting","level":2,"score":0.5749427676200867},{"id":"https://openalex.org/C2777515626","wikidata":"https://www.wikidata.org/wiki/Q496939","display_name":"Levenshtein distance","level":2,"score":0.5561563968658447},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5388628244400024},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.5284897089004517},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5208433270454407},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.507087230682373},{"id":"https://openalex.org/C90805587","wikidata":"https://www.wikidata.org/wiki/Q10944557","display_name":"Word (group theory)","level":2,"score":0.5019192695617676},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.501579761505127},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4437513053417206},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4195364713668823},{"id":"https://openalex.org/C193319292","wikidata":"https://www.wikidata.org/wiki/Q272172","display_name":"Hamming distance","level":2,"score":0.4182875156402588},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3867279589176178},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.14274129271507263},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.11564180254936218},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2017.8007019","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2017.8007019","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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W1647671624","https://openalex.org/W1946587648","https://openalex.org/W1969151232","https://openalex.org/W1981176808","https://openalex.org/W2029448413","https://openalex.org/W2068250877","https://openalex.org/W2098081605","https://openalex.org/W2109386785","https://openalex.org/W2120978458","https://openalex.org/W2122996899","https://openalex.org/W2125870772","https://openalex.org/W2170484108","https://openalex.org/W2319242569","https://openalex.org/W2340242219","https://openalex.org/W2509017166","https://openalex.org/W2584151571","https://openalex.org/W2725712048","https://openalex.org/W2963044831","https://openalex.org/W2963183421","https://openalex.org/W2963712885","https://openalex.org/W2964253788","https://openalex.org/W3099104497","https://openalex.org/W6636915900","https://openalex.org/W6640626097","https://openalex.org/W6676293227"],"related_works":["https://openalex.org/W4205451769","https://openalex.org/W1599365967","https://openalex.org/W2744545650","https://openalex.org/W4301166073","https://openalex.org/W4391272432","https://openalex.org/W2052976169","https://openalex.org/W2963483166","https://openalex.org/W3102491039","https://openalex.org/W2028976748","https://openalex.org/W2073595751"],"abstract_inverted_index":{"For":[0,66],"any":[1],"code,":[2],"the":[3,83,109,136,139,161],"set":[4],"of":[5,20,70,85,111,138,163],"received":[6,99],"words":[7,22],"generated":[8],"by":[9],"insertion":[10,45,121],"errors":[11,46],"is":[12,56,82,101,108,160],"infinitely":[13,18],"large.":[14],"We":[15,26],"prove":[16],"that":[17],"many":[19],"these":[21],"are":[23,42,74,125,170],"uniquely":[24],"decodable.":[25],"proceed":[27],"to":[28,58,133,173],"analyze":[29],"how":[30],"often":[31],"unique":[32,86,112],"decoding":[33,87,113],"from":[34],"insertions":[35,90,117],"occurs":[36],"for":[37,61,141],"arbitrary":[38,142],"codes.":[39],"These":[40],"questions":[41],"relevant":[43],"because":[44],"frequently":[47],"occur":[48],"in":[49,76],"synchronization":[50],"and":[51,119,123],"DNA,":[52],"a":[53,67,145],"medium":[54],"which":[55,169],"beginning":[57],"be":[59],"used":[60],"long":[62],"term":[63],"data":[64],"storage.":[65],"codeword":[68],"c":[69],"length":[71,95],"n,":[72],"we":[73],"interested":[75],"two":[77],"particular":[78,146],"measures.":[79],"The":[80,106],"first":[81],"probability":[84,110],"when":[88,114],"t":[89,98,115,152],"occur,":[91,118],"if":[92],"each":[93,120],"distinct":[94],"n":[96,154],"+":[97],"word":[100],"output":[102],"with":[103],"equal":[104],"probability.":[105],"second":[107],"sequential":[116],"position":[122],"element":[124],"selected":[126],"uniformly":[127],"at":[128],"random.":[129],"This":[130],"paper":[131],"attempts":[132],"better":[134],"understand":[135],"behavior":[137,150],"measures":[140],"codewords,":[143],"placing":[144],"emphasis":[147],"on":[148,166],"limiting":[149],"as":[151],"or":[153],"increases.":[155],"Our":[156],"most":[157],"substantial":[158],"contribution":[159],"derivation":[162],"upper":[164],"bounds":[165],"both":[167],"measures,":[168],"mathematically":[171],"related":[172],"Levenshtein's":[174],"reconstruction":[175],"problem.":[176]},"counts_by_year":[{"year":2017,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}