{"id":"https://openalex.org/W4415368568","doi":"https://doi.org/10.1109/isit63088.2025.11195209","title":"Improved Constructions of Linear Codes for Insertions and Deletions","display_name":"Improved Constructions of Linear Codes for Insertions and Deletions","publication_year":2025,"publication_date":"2025-06-22","ids":{"openalex":"https://openalex.org/W4415368568","doi":"https://doi.org/10.1109/isit63088.2025.11195209"},"language":null,"primary_location":{"id":"doi:10.1109/isit63088.2025.11195209","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit63088.2025.11195209","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 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/A5120072716","display_name":"Roee Gross","orcid":null},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Roee Gross","raw_affiliation_strings":["Technion&#x2014;Israel Institute of Technology,Department of Computer Science,Haifa,Israel,3200003"],"affiliations":[{"raw_affiliation_string":"Technion&#x2014;Israel Institute of Technology,Department of Computer Science,Haifa,Israel,3200003","institution_ids":["https://openalex.org/I174306211"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5025677091","display_name":"Roni Con","orcid":"https://orcid.org/0000-0002-0966-3818"},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Roni Con","raw_affiliation_strings":["Technion&#x2014;Israel Institute of Technology,Department of Computer Science,Haifa,Israel,3200003"],"affiliations":[{"raw_affiliation_string":"Technion&#x2014;Israel Institute of Technology,Department of Computer Science,Haifa,Israel,3200003","institution_ids":["https://openalex.org/I174306211"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5021586372","display_name":"Eitan Yaakobi","orcid":"https://orcid.org/0000-0002-9851-5234"},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Eitan Yaakobi","raw_affiliation_strings":["Technion&#x2014;Israel Institute of Technology,Department of Computer Science,Haifa,Israel,3200003"],"affiliations":[{"raw_affiliation_string":"Technion&#x2014;Israel Institute of Technology,Department of Computer Science,Haifa,Israel,3200003","institution_ids":["https://openalex.org/I174306211"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5120072716"],"corresponding_institution_ids":["https://openalex.org/I174306211"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.16458068,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.9987000226974487,"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.9987000226974487,"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/T11797","display_name":"graph theory and CDMA systems","score":0.9944000244140625,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9940000176429749,"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/linear-code","display_name":"Linear code","score":0.6068999767303467},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.524399995803833},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.5052000284194946},{"id":"https://openalex.org/keywords/indel","display_name":"Indel","score":0.47510001063346863},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.4537999927997589},{"id":"https://openalex.org/keywords/indel-mutation","display_name":"INDEL Mutation","score":0.42410001158714294},{"id":"https://openalex.org/keywords/encoding","display_name":"Encoding (memory)","score":0.34450000524520874}],"concepts":[{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.6068999767303467},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5267000198364258},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.524399995803833},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.5052000284194946},{"id":"https://openalex.org/C119054055","wikidata":"https://www.wikidata.org/wiki/Q1576681","display_name":"Indel","level":5,"score":0.47510001063346863},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.46209999918937683},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.4537999927997589},{"id":"https://openalex.org/C2910714999","wikidata":"https://www.wikidata.org/wiki/Q1576681","display_name":"INDEL Mutation","level":5,"score":0.42410001158714294},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3889999985694885},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.36559998989105225},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.34450000524520874},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.2962000072002411},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.2937000095844269},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.28200000524520874},{"id":"https://openalex.org/C114504821","wikidata":"https://www.wikidata.org/wiki/Q2164281","display_name":"Turbo code","level":3,"score":0.27469998598098755},{"id":"https://openalex.org/C73150493","wikidata":"https://www.wikidata.org/wiki/Q853922","display_name":"Hamming code","level":4,"score":0.2712000012397766},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.26159998774528503},{"id":"https://openalex.org/C76132124","wikidata":"https://www.wikidata.org/wiki/Q5474786","display_name":"Fountain code","level":5,"score":0.2540000081062317},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.2522999942302704}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit63088.2025.11195209","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit63088.2025.11195209","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 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":20,"referenced_works":["https://openalex.org/W1557415002","https://openalex.org/W1980073965","https://openalex.org/W1995875735","https://openalex.org/W2003177806","https://openalex.org/W2054076994","https://openalex.org/W2105597036","https://openalex.org/W2125870772","https://openalex.org/W2155020285","https://openalex.org/W2985767532","https://openalex.org/W3030897411","https://openalex.org/W3116490380","https://openalex.org/W3126358592","https://openalex.org/W3202561437","https://openalex.org/W4229748781","https://openalex.org/W4285264293","https://openalex.org/W4300176985","https://openalex.org/W4313887374","https://openalex.org/W4319996528","https://openalex.org/W4394711581","https://openalex.org/W4396754394"],"related_works":[],"abstract_inverted_index":{"In":[0],"this":[1,40],"work,":[2],"we":[3,98],"study":[4,130],"linear":[5,22,52,70,101,132],"error-correcting":[6],"codes":[7,23,53,65,102,133],"against":[8],"adversarial":[9],"insertion-deletion":[10],"(indel)":[11],"errors.":[12],"While":[13],"most":[14],"constructions":[15],"for":[16,50,134],"the":[17,47,129,135,142],"indel":[18,91,136],"model":[19],"are":[20],"nonlinear,":[21],"offer":[24],"compact":[25],"representations,":[26],"efficient":[27,51],"encoding,":[28],"and":[29],"decoding":[30],"algorithms,":[31],"making":[32],"them":[33,139],"highly":[34],"desirable.":[35],"A":[36],"key":[37],"challenge":[38],"in":[39],"area":[41],"is":[42],"achieving":[43],"rates":[44],"close":[45],"to":[46,141],"half-Singleton":[48,144],"bound":[49],"over":[54,66,71,103],"finite":[55],"fields.":[56],"We":[57],"improve":[58],"upon":[59],"previous":[60],"results":[61,126],"by":[62],"constructing":[63],"explicit":[64],"<tex":[67,72,77,87,94,104,109,120],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[68,73,78,88,95,105,110,121],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$\\mathbb{F}_{q^{2}}$</tex>,":[69],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$\\mathbb{F}_{q}$</tex>,":[74],"with":[75,107],"rate":[76,108],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$1":[79,111],"/":[80,112],"2-\\delta-\\varepsilon$</tex>":[81],"that":[82,115],"can":[83,116],"efficiently":[84,118],"correct":[85,119],"a":[86],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$\\delta$</tex>-fraction":[89,122],"of":[90,123,131],"errors,":[92],"where":[93],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$q=O\\left(\\varepsilon^{-4}\\right)$</tex>.":[96],"Additionally,":[97],"construct":[99],"fully":[100],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$\\mathbb{F}_{q}$</tex>":[106],"2-2":[113],"\\sqrt{\\delta}-\\varepsilon$</tex>":[114],"also":[117],"indels.":[124],"These":[125],"significantly":[127],"advance":[128],"model,":[137],"bringing":[138],"closer":[140],"theoretical":[143],"bound.":[145]},"counts_by_year":[],"updated_date":"2026-03-07T16:01:11.037858","created_date":"2025-10-21T00:00:00"}