{"id":"https://openalex.org/W4415366918","doi":"https://doi.org/10.1109/isit63088.2025.11195271","title":"Asymptotic Improvements to Provable Algorithms for the Code Equivalence Problem","display_name":"Asymptotic Improvements to Provable Algorithms for the Code Equivalence Problem","publication_year":2025,"publication_date":"2025-06-22","ids":{"openalex":"https://openalex.org/W4415366918","doi":"https://doi.org/10.1109/isit63088.2025.11195271"},"language":null,"primary_location":{"id":"doi:10.1109/isit63088.2025.11195271","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit63088.2025.11195271","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/A5047830282","display_name":"Huck Bennett","orcid":"https://orcid.org/0000-0002-5469-8841"},"institutions":[{"id":"https://openalex.org/I188538660","display_name":"University of Colorado Boulder","ror":"https://ror.org/02ttsq026","country_code":"US","type":"education","lineage":["https://openalex.org/I188538660"]},{"id":"https://openalex.org/I2802236040","display_name":"University of Colorado System","ror":"https://ror.org/00jc20583","country_code":"US","type":"education","lineage":["https://openalex.org/I2802236040"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Huck Bennett","raw_affiliation_strings":["University of Colorado Boulder"],"affiliations":[{"raw_affiliation_string":"University of Colorado Boulder","institution_ids":["https://openalex.org/I2802236040","https://openalex.org/I188538660"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Drisana Bhatia","orcid":null},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Drisana Bhatia","raw_affiliation_strings":["University of California Berkeley"],"affiliations":[{"raw_affiliation_string":"University of California Berkeley","institution_ids":["https://openalex.org/I95457486"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5030566023","display_name":"Jean\u2010Fran\u00e7ois Biasse","orcid":"https://orcid.org/0000-0001-8591-8408"},"institutions":[{"id":"https://openalex.org/I2613432","display_name":"University of South Florida","ror":"https://ror.org/032db5x82","country_code":"US","type":"education","lineage":["https://openalex.org/I2613432"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jean-Francois Biasse","raw_affiliation_strings":["University of South Florida"],"affiliations":[{"raw_affiliation_string":"University of South Florida","institution_ids":["https://openalex.org/I2613432"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5120072227","display_name":"Medha Durisheti","orcid":null},"institutions":[{"id":"https://openalex.org/I859038795","display_name":"Virginia Tech","ror":"https://ror.org/02smfhw86","country_code":"US","type":"education","lineage":["https://openalex.org/I859038795"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Medha Durisheti","raw_affiliation_strings":["Virginia Tech"],"affiliations":[{"raw_affiliation_string":"Virginia Tech","institution_ids":["https://openalex.org/I859038795"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5120072228","display_name":"Lucas LaBuff","orcid":null},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Lucas LaBuff","raw_affiliation_strings":["University of Maryland at College Park"],"affiliations":[{"raw_affiliation_string":"University of Maryland at College Park","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5010029041","display_name":"Vincenzo Pallozzi Lavorante","orcid":"https://orcid.org/0000-0002-8725-5473"},"institutions":[{"id":"https://openalex.org/I2613432","display_name":"University of South Florida","ror":"https://ror.org/032db5x82","country_code":"US","type":"education","lineage":["https://openalex.org/I2613432"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Vincenzo Pallozzi Lavorante","raw_affiliation_strings":["University of South Florida"],"affiliations":[{"raw_affiliation_string":"University of South Florida","institution_ids":["https://openalex.org/I2613432"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5120072229","display_name":"Philip Waitkevich","orcid":null},"institutions":[{"id":"https://openalex.org/I2613432","display_name":"University of South Florida","ror":"https://ror.org/032db5x82","country_code":"US","type":"education","lineage":["https://openalex.org/I2613432"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Philip Waitkevich","raw_affiliation_strings":["University of South Florida"],"affiliations":[{"raw_affiliation_string":"University of South Florida","institution_ids":["https://openalex.org/I2613432"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":7,"corresponding_author_ids":["https://openalex.org/A5047830282"],"corresponding_institution_ids":["https://openalex.org/I188538660","https://openalex.org/I2802236040"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.1513069,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9830999970436096,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9830999970436096,"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/T11130","display_name":"Coding theory and cryptography","score":0.9584000110626221,"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.9483000040054321,"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/equivalence","display_name":"Equivalence (formal languages)","score":0.6132000088691711},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.5235000252723694},{"id":"https://openalex.org/keywords/permutation","display_name":"Permutation (music)","score":0.46480000019073486},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.39010000228881836},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.35760000348091125},{"id":"https://openalex.org/keywords/deterministic-algorithm","display_name":"Deterministic algorithm","score":0.35350000858306885},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.35260000824928284},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.3149999976158142}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.631600022315979},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.6132000088691711},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5436999797821045},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.5235000252723694},{"id":"https://openalex.org/C21308566","wikidata":"https://www.wikidata.org/wiki/Q7169365","display_name":"Permutation (music)","level":2,"score":0.46480000019073486},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.41350001096725464},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.39010000228881836},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.35760000348091125},{"id":"https://openalex.org/C13533509","wikidata":"https://www.wikidata.org/wiki/Q1064349","display_name":"Deterministic algorithm","level":2,"score":0.35350000858306885},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.35260000824928284},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3255000114440918},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.3149999976158142},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.30640000104904175},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.3059000074863434},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.3052000105381012},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.304500013589859},{"id":"https://openalex.org/C43126263","wikidata":"https://www.wikidata.org/wiki/Q128751","display_name":"Source code","level":2,"score":0.301800012588501},{"id":"https://openalex.org/C2777044963","wikidata":"https://www.wikidata.org/wiki/Q5384707","display_name":"Equivalence class (music)","level":2,"score":0.29600000381469727},{"id":"https://openalex.org/C9652623","wikidata":"https://www.wikidata.org/wiki/Q190109","display_name":"Field (mathematics)","level":2,"score":0.29490000009536743},{"id":"https://openalex.org/C77926391","wikidata":"https://www.wikidata.org/wiki/Q603880","display_name":"Finite field","level":2,"score":0.2924000024795532},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.27880001068115234}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit63088.2025.11195271","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit63088.2025.11195271","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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1589034595","https://openalex.org/W2065259180","https://openalex.org/W2082432729","https://openalex.org/W2084652510","https://openalex.org/W2103398070","https://openalex.org/W2109371739","https://openalex.org/W2119117325","https://openalex.org/W2409645877","https://openalex.org/W2898617375","https://openalex.org/W2943595314","https://openalex.org/W2951311167","https://openalex.org/W3217002692","https://openalex.org/W4239350281","https://openalex.org/W4292209587"],"related_works":[],"abstract_inverted_index":{"We":[0],"present":[1],"several":[2],"new":[3],"provable":[4],"algorithms":[5,99,110],"for":[6,32,64,77,92,117],"two":[7,98],"variants":[8],"of":[9,35,104,127],"the":[10,18,25],"code":[11,118],"equivalence":[12,119],"problem":[13],"on":[14,101,120],"linear":[15],"error-correcting":[16],"codes,":[17],"Linear":[19],"Code":[20,27],"Equivalence":[21,28],"Problem":[22,29],"(LCE)":[23],"and":[24,41,79,94,123],"Permutation":[26],"(PCE).":[30],"Specifically,":[31],"arbitrary":[33],"codes":[34,122],"block":[36],"length":[37],"<tex":[38,43,50,60,71,86,129],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[39,44,51,61,72,87,130],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$n$</tex>":[40],"dimension":[42],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$k$</tex>":[45],"over":[46,125],"any":[47],"finite":[48],"field":[49],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$\\mathbb{F}_{q}$</tex>,":[52],"we":[53],"show:":[54],"1)A":[55],"deterministic":[56],"algorithm":[57,68,83],"running":[58,69,84,113],"in":[59,70,85],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$2^{n+o(n+q)}$</tex>":[62],"time":[63,76,91],"LCE.":[65],"2)A":[66],"randomized":[67],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$2^{n":[73,88],"/":[74,89],"2+o(n+q)}$</tex>":[75],"LCE":[78,93],"PCE.":[80,95],"3)A":[81],"quantum":[82],"3+o(n+q)}$</tex>":[90],"The":[96],"second":[97],"improve":[100],"recent":[102],"work":[103],"Nowakowski":[105],"(PQCrypto":[106],"2025),":[107],"which":[108],"gave":[109],"with":[111],"similar":[112],"times":[114],"but":[115],"only":[116,124],"random":[121],"fields":[126],"order":[128],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$q":[131],"\\geq":[132],"7$</tex>.":[133]},"counts_by_year":[],"updated_date":"2026-04-21T08:09:41.155169","created_date":"2025-10-21T00:00:00"}