{"id":"https://openalex.org/W2975173276","doi":"https://doi.org/10.1109/isit.2019.8849427","title":"List Decoding of Deletions Using Guess & Check Codes","display_name":"List Decoding of Deletions Using Guess & Check Codes","publication_year":2019,"publication_date":"2019-07-01","ids":{"openalex":"https://openalex.org/W2975173276","doi":"https://doi.org/10.1109/isit.2019.8849427","mag":"2975173276"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2019.8849427","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2019.8849427","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://hal.science/hal-05331701","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5084727849","display_name":"Serge Kas Hanna","orcid":"https://orcid.org/0000-0002-3057-7527"},"institutions":[{"id":"https://openalex.org/I4210096112","display_name":"Rutgers Sexual and Reproductive Health and Rights","ror":"https://ror.org/00rcvgx40","country_code":"NL","type":"other","lineage":["https://openalex.org/I4210096112"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Serge Kas Hanna","raw_affiliation_strings":["ECE Department, Rutgers University"],"affiliations":[{"raw_affiliation_string":"ECE Department, Rutgers University","institution_ids":["https://openalex.org/I4210096112"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5110217226","display_name":"Salim El Rouayheb","orcid":"https://orcid.org/0009-0005-4515-2213"},"institutions":[{"id":"https://openalex.org/I4210096112","display_name":"Rutgers Sexual and Reproductive Health and Rights","ror":"https://ror.org/00rcvgx40","country_code":"NL","type":"other","lineage":["https://openalex.org/I4210096112"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Salim El Rouayheb","raw_affiliation_strings":["ECE Department, Rutgers University"],"affiliations":[{"raw_affiliation_string":"ECE Department, Rutgers University","institution_ids":["https://openalex.org/I4210096112"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5084727849"],"corresponding_institution_ids":["https://openalex.org/I4210096112"],"apc_list":null,"apc_paid":null,"fwci":0.257,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.56743036,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"2374","last_page":"2378"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.9995999932289124,"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.9995999932289124,"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/T10207","display_name":"Advanced biosensing and bioanalysis techniques","score":0.9993000030517578,"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.9990000128746033,"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/list-decoding","display_name":"List decoding","score":0.8067162036895752},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.7157132029533386},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.5752135515213013},{"id":"https://openalex.org/keywords/sequential-decoding","display_name":"Sequential decoding","score":0.5492517948150635},{"id":"https://openalex.org/keywords/berlekamp\u2013welch-algorithm","display_name":"Berlekamp\u2013Welch algorithm","score":0.4950198531150818},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4651162922382355},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.45459771156311035},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4511222243309021},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4267137348651886},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.41346651315689087},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4048038423061371},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.3805181682109833},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3744566738605499},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.33684492111206055}],"concepts":[{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.8067162036895752},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.7157132029533386},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.5752135515213013},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.5492517948150635},{"id":"https://openalex.org/C132727834","wikidata":"https://www.wikidata.org/wiki/Q4892328","display_name":"Berlekamp\u2013Welch algorithm","level":5,"score":0.4950198531150818},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4651162922382355},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.45459771156311035},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4511222243309021},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4267137348651886},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.41346651315689087},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4048038423061371},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.3805181682109833},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3744566738605499},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.33684492111206055},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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":2,"locations":[{"id":"doi:10.1109/isit.2019.8849427","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2019.8849427","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},{"id":"pmh:oai:HAL:hal-05331701v1","is_oa":true,"landing_page_url":"https://hal.science/hal-05331701","pdf_url":null,"source":{"id":"https://openalex.org/S4406922461","display_name":"SPIRE - Sciences Po Institutional REpository","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"2019 IEEE International Symposium on Information Theory (ISIT), Jul 2019, Paris, France. pp.2374-2378, ⟨10.1109/ISIT.2019.8849427⟩","raw_type":"Conference papers"}],"best_oa_location":{"id":"pmh:oai:HAL:hal-05331701v1","is_oa":true,"landing_page_url":"https://hal.science/hal-05331701","pdf_url":null,"source":{"id":"https://openalex.org/S4406922461","display_name":"SPIRE - Sciences Po Institutional REpository","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"2019 IEEE International Symposium on Information Theory (ISIT), Jul 2019, Paris, France. pp.2374-2378, ⟨10.1109/ISIT.2019.8849427⟩","raw_type":"Conference papers"},"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/W1941245335","https://openalex.org/W2029448413","https://openalex.org/W2044492449","https://openalex.org/W2098081605","https://openalex.org/W2102799756","https://openalex.org/W2106045225","https://openalex.org/W2106215079","https://openalex.org/W2117571667","https://openalex.org/W2120978458","https://openalex.org/W2607899764","https://openalex.org/W2615147001","https://openalex.org/W2751518651","https://openalex.org/W2783704865","https://openalex.org/W2897128591","https://openalex.org/W2897671136","https://openalex.org/W2963044831","https://openalex.org/W2963231289","https://openalex.org/W2964230863","https://openalex.org/W2964253788","https://openalex.org/W3100438601","https://openalex.org/W6636915900","https://openalex.org/W6676144961","https://openalex.org/W6737158113","https://openalex.org/W6747388879"],"related_works":["https://openalex.org/W2897128591","https://openalex.org/W2963503249","https://openalex.org/W2964230863","https://openalex.org/W2751518651","https://openalex.org/W3206182256","https://openalex.org/W2964253788","https://openalex.org/W2097499124","https://openalex.org/W2744545650","https://openalex.org/W2950043032","https://openalex.org/W1526937036","https://openalex.org/W2963148175","https://openalex.org/W2600020773","https://openalex.org/W57000119","https://openalex.org/W3113522538","https://openalex.org/W3171310007","https://openalex.org/W2168455976","https://openalex.org/W3092309105","https://openalex.org/W1573296009","https://openalex.org/W2209785619","https://openalex.org/W2990034516"],"abstract_inverted_index":{"Guess":[0],"&":[1],"Check":[2],"(GC)":[3],"codes":[4,8,18,37,58,131,162],"are":[5,38],"systematic":[6],"binary":[7],"that":[9,145],"can":[10],"correct":[11],"multiple":[12,164],"deletions,":[13],"with":[14],"high":[15],"probability.":[16],"GC":[17,57,96,130,161],"have":[19],"logarithmic":[20],"redundancy":[21],"in":[22,42,61,139],"the":[23,26,30,66,73,83,87,91,111,115,156],"length":[24],"of":[25,35,49,56,77,90,102,114,129,148,160,166],"message":[27],"k,":[28,134],"and":[29,32,40,86,122,168],"encoding":[31],"decoding":[33,54,75,158],"algorithms":[34],"these":[36,78],"deterministic":[39],"run":[41],"polynomial":[43],"time":[44],"for":[45,98,163],"a":[46,62,95,99,143],"constant":[47,100,144],"number":[48,101],"deletions":[50,103],"\u03b4.":[51,104,169],"The":[52,105],"unique":[53],"properties":[55],"were":[59],"examined":[60],"previous":[63],"work":[64],"by":[65,94,133,142],"authors.":[67],"In":[68],"this":[69],"paper,":[70],"we":[71,81],"investigate":[72],"list":[74,92,116,137,157],"performance":[76,159],"codes.":[79],"Namely,":[80],"study":[82],"average":[84,112],"size":[85,89,113,138],"maximum":[88,136],"obtained":[93],"decoder":[97],"theoretical":[106],"results":[107],"show":[108],"that:":[109],"(i)":[110],"approaches":[117],"1":[118],"as":[119],"k":[120,167],"grows;":[121],"(ii)":[123],"there":[124],"exists":[125],"an":[126],"infinite":[127],"sequence":[128],"indexed":[132],"whose":[135],"upper":[140],"bounded":[141],"is":[146],"independent":[147],"k.":[149],"We":[150],"also":[151],"provide":[152],"numerical":[153],"simulations":[154],"on":[155],"values":[165]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1}],"updated_date":"2026-03-14T06:41:57.775601","created_date":"2025-10-10T00:00:00"}