{"id":"https://openalex.org/W4414231931","doi":"https://doi.org/10.1109/istc65386.2025.11154510","title":"On the Redundancy of Function-Correcting Codes over Finite Fields","display_name":"On the Redundancy of Function-Correcting Codes over Finite Fields","publication_year":2025,"publication_date":"2025-08-18","ids":{"openalex":"https://openalex.org/W4414231931","doi":"https://doi.org/10.1109/istc65386.2025.11154510"},"language":"en","primary_location":{"id":"doi:10.1109/istc65386.2025.11154510","is_oa":false,"landing_page_url":"https://doi.org/10.1109/istc65386.2025.11154510","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 13th International Symposium on Topics in Coding (ISTC)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5113396682","display_name":"H. Ly","orcid":null},"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":"Hoang Ly","raw_affiliation_strings":["Rutgers University,Department of Electrical & Computer Engineering"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Rutgers University,Department of Electrical & Computer Engineering","institution_ids":["https://openalex.org/I4210096112"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5034577486","display_name":"Emina Soljanin","orcid":"https://orcid.org/0000-0002-7464-4242"},"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":"Emina Soljanin","raw_affiliation_strings":["Rutgers University,Department of Electrical & Computer Engineering"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Rutgers University,Department of Electrical & Computer Engineering","institution_ids":["https://openalex.org/I4210096112"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I4210096112"],"apc_list":null,"apc_paid":null,"fwci":1.673,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.85133863,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"5"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.9986000061035156,"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.9986000061035156,"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/T11181","display_name":"Advanced Data Storage Technologies","score":0.9958999752998352,"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"}},{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9860000014305115,"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/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.8561000227928162},{"id":"https://openalex.org/keywords/finite-field","display_name":"Finite field","score":0.6894000172615051},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.6504999995231628},{"id":"https://openalex.org/keywords/redundancy","display_name":"Redundancy (engineering)","score":0.6111000180244446},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.5825999975204468},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.49149999022483826},{"id":"https://openalex.org/keywords/finite-set","display_name":"Finite set","score":0.4189000129699707}],"concepts":[{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.8561000227928162},{"id":"https://openalex.org/C77926391","wikidata":"https://www.wikidata.org/wiki/Q603880","display_name":"Finite field","level":2,"score":0.6894000172615051},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6525999903678894},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.6504999995231628},{"id":"https://openalex.org/C152124472","wikidata":"https://www.wikidata.org/wiki/Q1204361","display_name":"Redundancy (engineering)","level":2,"score":0.6111000180244446},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.5825999975204468},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.49149999022483826},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4616999924182892},{"id":"https://openalex.org/C162392398","wikidata":"https://www.wikidata.org/wiki/Q272404","display_name":"Finite set","level":2,"score":0.4189000129699707},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.41280001401901245},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.37040001153945923},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.3255000114440918},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.31949999928474426},{"id":"https://openalex.org/C63435697","wikidata":"https://www.wikidata.org/wiki/Q864135","display_name":"Binary code","level":3,"score":0.30230000615119934},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.2734000086784363},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.2653999924659729},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.2644999921321869},{"id":"https://openalex.org/C137627569","wikidata":"https://www.wikidata.org/wiki/Q245471","display_name":"Cyclic redundancy check","level":3,"score":0.2621999979019165}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/istc65386.2025.11154510","is_oa":false,"landing_page_url":"https://doi.org/10.1109/istc65386.2025.11154510","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 13th International Symposium on Topics in Coding (ISTC)","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":6,"referenced_works":["https://openalex.org/W2127908002","https://openalex.org/W3128488067","https://openalex.org/W3198011113","https://openalex.org/W4289812304","https://openalex.org/W4401980584","https://openalex.org/W4405908870"],"related_works":[],"abstract_inverted_index":{"Function-correcting":[0],"codes":[1,23],"(FCC)":[2],"protect":[3],"specific":[4],"function":[5],"evaluations":[6],"of":[7,63],"a":[8,15,40,60,126],"message":[9],"against":[10],"errors.":[11],"This":[12],"condition":[13],"imposes":[14],"less":[16],"stringent":[17],"distance":[18],"requirement":[19],"than":[20],"classical":[21],"error-correcting":[22],"(ECC),":[24],"allowing":[25],"for":[26,47,75,87],"reduced":[27],"redundancy.":[28,111],"FCC":[29,48],"were":[30],"introduced":[31],"by":[32,91,114],"Lenz":[33],"et":[34],"al.":[35],"(2021),":[36],"who":[37],"also":[38,95],"established":[39],"lower":[41,65,72],"bound":[42,58,73,84,123,129],"on":[43],"the":[44,50,70],"optimal":[45,110],"redundancy":[46],"over":[49],"binary":[51],"field.":[52,78],"Here,":[53],"we":[54,80,102,119],"derive":[55],"an":[56,98,104],"upper":[57,99,128],"within":[59],"logarithmic":[61],"factor":[62],"this":[64,83,109],"bound.":[66,100],"We":[67],"show":[68,81],"that":[69,82,93,107,121],"same":[71],"holds":[74],"any":[76],"finite":[77,132],"Moreover,":[79],"is":[85],"matched":[86],"sufficiently":[88],"large":[89],"fields":[90],"demonstrating":[92],"it":[94],"serves":[96,124],"as":[97,125],"Furthermore,":[101],"construct":[103],"encoding":[105],"scheme":[106],"achieves":[108],"Finally,":[112],"motivated":[113],"these":[115],"two":[116],"extreme":[117],"regimes,":[118],"conjecture":[120],"our":[122],"valid":[127],"across":[130],"all":[131],"fields.":[133]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}