{"id":"https://openalex.org/W4386066776","doi":"https://doi.org/10.1109/isit54713.2023.10206992","title":"Linial\u2019s Algorithm and Systematic Deletion-Correcting Codes","display_name":"Linial\u2019s Algorithm and Systematic Deletion-Correcting Codes","publication_year":2023,"publication_date":"2023-06-25","ids":{"openalex":"https://openalex.org/W4386066776","doi":"https://doi.org/10.1109/isit54713.2023.10206992"},"language":"en","primary_location":{"id":"doi:10.1109/isit54713.2023.10206992","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/isit54713.2023.10206992","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 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/A5100377767","display_name":"Yuting Li","orcid":"https://orcid.org/0000-0002-6716-358X"},"institutions":[{"id":"https://openalex.org/I20231570","display_name":"Peking University","ror":"https://ror.org/02v51f717","country_code":"CN","type":"education","lineage":["https://openalex.org/I20231570"]},{"id":"https://openalex.org/I4210124601","display_name":"Department of Mathematical Sciences","ror":"https://ror.org/02xkdev90","country_code":"RU","type":"government","lineage":["https://openalex.org/I1313323035","https://openalex.org/I4210124601"]}],"countries":["CN","RU"],"is_corresponding":true,"raw_author_name":"Yuting Li","raw_affiliation_strings":["Peking University,School of Mathematical Science","School of Mathematical Science, Peking University"],"affiliations":[{"raw_affiliation_string":"Peking University,School of Mathematical Science","institution_ids":["https://openalex.org/I20231570","https://openalex.org/I4210124601"]},{"raw_affiliation_string":"School of Mathematical Science, Peking University","institution_ids":["https://openalex.org/I20231570"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5011621481","display_name":"Farzad Farnoud","orcid":"https://orcid.org/0000-0002-8684-4487"},"institutions":[{"id":"https://openalex.org/I51556381","display_name":"University of Virginia","ror":"https://ror.org/0153tk833","country_code":"US","type":"education","lineage":["https://openalex.org/I51556381"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Farzad Farnoud","raw_affiliation_strings":["University of Virginia,Electrical and Computer Engineering","Electrical and Computer Engineering, University of Virginia"],"affiliations":[{"raw_affiliation_string":"University of Virginia,Electrical and Computer Engineering","institution_ids":["https://openalex.org/I51556381"]},{"raw_affiliation_string":"Electrical and Computer Engineering, University of Virginia","institution_ids":["https://openalex.org/I51556381"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5100377767"],"corresponding_institution_ids":["https://openalex.org/I20231570","https://openalex.org/I4210124601"],"apc_list":null,"apc_paid":null,"fwci":0.4784,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.67566452,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"2703","last_page":"2707"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.9980000257492065,"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":0.9980000257492065,"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/T11130","display_name":"Coding theory and cryptography","score":0.9794999957084656,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9763000011444092,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.636578381061554},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5945351719856262},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5539959073066711},{"id":"https://openalex.org/keywords/alphabet","display_name":"Alphabet","score":0.5371741652488708},{"id":"https://openalex.org/keywords/redundancy","display_name":"Redundancy (engineering)","score":0.5279406905174255},{"id":"https://openalex.org/keywords/log-log-plot","display_name":"Log-log plot","score":0.49778223037719727},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.45241448283195496},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.44179248809814453},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.44123658537864685},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.363101065158844},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3388853669166565}],"concepts":[{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.636578381061554},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5945351719856262},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5539959073066711},{"id":"https://openalex.org/C112876837","wikidata":"https://www.wikidata.org/wiki/Q837518","display_name":"Alphabet","level":2,"score":0.5371741652488708},{"id":"https://openalex.org/C152124472","wikidata":"https://www.wikidata.org/wiki/Q1204361","display_name":"Redundancy (engineering)","level":2,"score":0.5279406905174255},{"id":"https://openalex.org/C195292467","wikidata":"https://www.wikidata.org/wiki/Q2091879","display_name":"Log-log plot","level":3,"score":0.49778223037719727},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.45241448283195496},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.44179248809814453},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.44123658537864685},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.363101065158844},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3388853669166565},{"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/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit54713.2023.10206992","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/isit54713.2023.10206992","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 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":12,"referenced_works":["https://openalex.org/W82018972","https://openalex.org/W2081354249","https://openalex.org/W2112009244","https://openalex.org/W2164604747","https://openalex.org/W2751518651","https://openalex.org/W3080366099","https://openalex.org/W3080550366","https://openalex.org/W3081339149","https://openalex.org/W3092309105","https://openalex.org/W4285243775","https://openalex.org/W4301139072","https://openalex.org/W6698193593"],"related_works":["https://openalex.org/W2035522910","https://openalex.org/W2005615533","https://openalex.org/W2055932080","https://openalex.org/W4377371889","https://openalex.org/W2018076478","https://openalex.org/W1992470151","https://openalex.org/W2113623403","https://openalex.org/W1968512104","https://openalex.org/W1862126075","https://openalex.org/W78560857"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3,79],"present":[4],"a":[5,13,49,157],"universal":[6],"method":[7,30,155],"to":[8,22],"construct":[9,80],"systematic":[10,81,107],"codes":[11,41,82,108],"correcting":[12,83,109],"constant":[14],"number":[15],"of":[16,70,150,159],"errors":[17],"that":[18,51,131],"are":[19],"traditionally":[20],"hard":[21],"handle,":[23],"such":[24],"as":[25,147],"insertions":[26],"and":[27,39,45,73,86,106],"deletions.":[28],"Our":[29],"is":[31,52,67,75,156],"based":[32],"on":[33],"Linial\u2019s":[34,151],"distributed":[35],"graph":[36],"coloring":[37],"algorithm,":[38],"the":[40,55,68,71,76,132],"have":[42],"polynomial-time":[43],"encoding":[44],"decoding":[46],"complexity,":[47],"with":[48,89,115],"redundancy":[50,90,116],"about":[53],"twice":[54],"Gilbert-Varshamov":[56],"bound.":[57],"As":[58],"an":[59,148],"application,":[60],"for":[61],"q":[62,66,101],"=":[63],"O(poly(n)),":[64],"where":[65],"size":[69],"alphabet":[72],"n":[74,95],"code":[77],"length,":[78],"t":[84,110],"deletions":[85,111],"s":[87,113],"substitutions":[88,114],"(4t":[91],"+":[92,96,98,102],"4s)":[93],"log":[94,100,104,120,124,126],"(3t":[97],"6s)":[99],"O(log":[103],"n)":[105],"or":[112],"4":[117],"max{t,":[118,122],"s}":[119],"n+3":[121],"2s}":[123],"q+O(log":[125],"n).":[127],"We":[128],"also":[129],"show":[130],"celebrated":[133],"\u2018syndrome":[134],"compression\u2019":[135],"technique,":[136],"proposed":[137],"by":[138],"Sima":[139],"et":[140],"al.":[141],"(ISIT":[142],"2020),":[143],"can":[144],"be":[145],"viewed":[146],"application":[149],"algorithm.":[152],"Thus":[153],"our":[154],"generalization":[158],"syndrome":[160],"compression.":[161]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":2}],"updated_date":"2025-12-24T23:09:58.560324","created_date":"2025-10-10T00:00:00"}