{"id":"https://openalex.org/W4391468556","doi":"https://doi.org/10.1109/wcsp58612.2023.10404656","title":"A Fast Algorithm for Finding the Roots of Polynomials over Finite Fields","display_name":"A Fast Algorithm for Finding the Roots of Polynomials over Finite Fields","publication_year":2023,"publication_date":"2023-11-02","ids":{"openalex":"https://openalex.org/W4391468556","doi":"https://doi.org/10.1109/wcsp58612.2023.10404656"},"language":"en","primary_location":{"id":"doi:10.1109/wcsp58612.2023.10404656","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/wcsp58612.2023.10404656","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 International Conference on Wireless Communications and Signal Processing (WCSP)","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/A5100666036","display_name":"Pingping Li","orcid":"https://orcid.org/0000-0003-0679-270X"},"institutions":[{"id":"https://openalex.org/I2799850029","display_name":"Dongguan University of Technology","ror":"https://ror.org/01m8p7q42","country_code":"CN","type":"education","lineage":["https://openalex.org/I2799850029"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Pingping Li","raw_affiliation_strings":["Dongguan University of Technology,School of Computer Science & Technology,Dongguan,China"],"affiliations":[{"raw_affiliation_string":"Dongguan University of Technology,School of Computer Science & Technology,Dongguan,China","institution_ids":["https://openalex.org/I2799850029"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5043501219","display_name":"Leilei Yu","orcid":"https://orcid.org/0000-0003-3528-5483"},"institutions":[{"id":"https://openalex.org/I4210145761","display_name":"Shenzhen Institutes of Advanced Technology","ror":"https://ror.org/04gh4er46","country_code":"CN","type":"facility","lineage":["https://openalex.org/I19820366","https://openalex.org/I4210145761"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Leilei Yu","raw_affiliation_strings":["University of Electronic Science & Technology of China,Shenzhen Institute for Advanced Study"],"affiliations":[{"raw_affiliation_string":"University of Electronic Science & Technology of China,Shenzhen Institute for Advanced Study","institution_ids":["https://openalex.org/I4210145761"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5035185924","display_name":"Linqi Song","orcid":"https://orcid.org/0000-0003-2756-4984"},"institutions":[{"id":"https://openalex.org/I168719708","display_name":"City University of Hong Kong","ror":"https://ror.org/03q8dnn23","country_code":"HK","type":"education","lineage":["https://openalex.org/I168719708"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Linqi Song","raw_affiliation_strings":["City University of Hong Kong,Department of Computer Science,Hong Kong,China","Department of Computer Science, City University of Hong Kong, Hong Kong, China"],"affiliations":[{"raw_affiliation_string":"City University of Hong Kong,Department of Computer Science,Hong Kong,China","institution_ids":["https://openalex.org/I168719708"]},{"raw_affiliation_string":"Department of Computer Science, City University of Hong Kong, Hong Kong, China","institution_ids":["https://openalex.org/I168719708"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5039863234","display_name":"Hanxu Hou","orcid":"https://orcid.org/0000-0001-7328-9341"},"institutions":[{"id":"https://openalex.org/I168719708","display_name":"City University of Hong Kong","ror":"https://ror.org/03q8dnn23","country_code":"HK","type":"education","lineage":["https://openalex.org/I168719708"]},{"id":"https://openalex.org/I2799850029","display_name":"Dongguan University of Technology","ror":"https://ror.org/01m8p7q42","country_code":"CN","type":"education","lineage":["https://openalex.org/I2799850029"]}],"countries":["CN","HK"],"is_corresponding":false,"raw_author_name":"Hanxu Hou","raw_affiliation_strings":["City University of Hong Kong,Department of Computer Science,Hong Kong,China","School of Electrical Engineering & Intelligentization, Dongguan University of Technology, Dongguan, China","Department of Computer Science, City University of Hong Kong, Hong Kong, China"],"affiliations":[{"raw_affiliation_string":"City University of Hong Kong,Department of Computer Science,Hong Kong,China","institution_ids":["https://openalex.org/I168719708"]},{"raw_affiliation_string":"School of Electrical Engineering & Intelligentization, Dongguan University of Technology, Dongguan, China","institution_ids":["https://openalex.org/I2799850029"]},{"raw_affiliation_string":"Department of Computer Science, City University of Hong Kong, Hong Kong, China","institution_ids":["https://openalex.org/I168719708"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5100666036"],"corresponding_institution_ids":["https://openalex.org/I2799850029"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.19914623,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"299","last_page":"304"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.9998000264167786,"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.9998000264167786,"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.9987999796867371,"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/T11693","display_name":"Cryptography and Residue Arithmetic","score":0.9952999949455261,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/finite-field","display_name":"Finite field","score":0.8747335076332092},{"id":"https://openalex.org/keywords/fast-fourier-transform","display_name":"Fast Fourier transform","score":0.7461358904838562},{"id":"https://openalex.org/keywords/bch-code","display_name":"BCH code","score":0.7260617613792419},{"id":"https://openalex.org/keywords/multiplicative-function","display_name":"Multiplicative function","score":0.6959472298622131},{"id":"https://openalex.org/keywords/cyclotomic-fast-fourier-transform","display_name":"Cyclotomic fast Fourier transform","score":0.6326942443847656},{"id":"https://openalex.org/keywords/coding-theory","display_name":"Coding theory","score":0.5885055661201477},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5634680390357971},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5584960579872131},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.5463573932647705},{"id":"https://openalex.org/keywords/berlekamp\u2013welch-algorithm","display_name":"Berlekamp\u2013Welch algorithm","score":0.4832763969898224},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.463326632976532},{"id":"https://openalex.org/keywords/fourier-transform","display_name":"Fourier transform","score":0.4600221514701843},{"id":"https://openalex.org/keywords/field","display_name":"Field (mathematics)","score":0.44708001613616943},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3927875757217407},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.33148735761642456},{"id":"https://openalex.org/keywords/fourier-analysis","display_name":"Fourier analysis","score":0.3001422882080078},{"id":"https://openalex.org/keywords/sequential-decoding","display_name":"Sequential decoding","score":0.20172062516212463},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.1393895149230957},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.12897497415542603},{"id":"https://openalex.org/keywords/short-time-fourier-transform","display_name":"Short-time Fourier transform","score":0.0797419548034668},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.07467687129974365}],"concepts":[{"id":"https://openalex.org/C77926391","wikidata":"https://www.wikidata.org/wiki/Q603880","display_name":"Finite field","level":2,"score":0.8747335076332092},{"id":"https://openalex.org/C75172450","wikidata":"https://www.wikidata.org/wiki/Q623950","display_name":"Fast Fourier transform","level":2,"score":0.7461358904838562},{"id":"https://openalex.org/C42276685","wikidata":"https://www.wikidata.org/wiki/Q795705","display_name":"BCH code","level":3,"score":0.7260617613792419},{"id":"https://openalex.org/C42747912","wikidata":"https://www.wikidata.org/wiki/Q1048447","display_name":"Multiplicative function","level":2,"score":0.6959472298622131},{"id":"https://openalex.org/C43060483","wikidata":"https://www.wikidata.org/wiki/Q17006372","display_name":"Cyclotomic fast Fourier transform","level":5,"score":0.6326942443847656},{"id":"https://openalex.org/C113709454","wikidata":"https://www.wikidata.org/wiki/Q602136","display_name":"Coding theory","level":2,"score":0.5885055661201477},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5634680390357971},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5584960579872131},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.5463573932647705},{"id":"https://openalex.org/C132727834","wikidata":"https://www.wikidata.org/wiki/Q4892328","display_name":"Berlekamp\u2013Welch algorithm","level":5,"score":0.4832763969898224},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.463326632976532},{"id":"https://openalex.org/C102519508","wikidata":"https://www.wikidata.org/wiki/Q6520159","display_name":"Fourier transform","level":2,"score":0.4600221514701843},{"id":"https://openalex.org/C9652623","wikidata":"https://www.wikidata.org/wiki/Q190109","display_name":"Field (mathematics)","level":2,"score":0.44708001613616943},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3927875757217407},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.33148735761642456},{"id":"https://openalex.org/C203024314","wikidata":"https://www.wikidata.org/wiki/Q1365258","display_name":"Fourier analysis","level":3,"score":0.3001422882080078},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.20172062516212463},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.1393895149230957},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.12897497415542603},{"id":"https://openalex.org/C166386157","wikidata":"https://www.wikidata.org/wiki/Q1477735","display_name":"Short-time Fourier transform","level":4,"score":0.0797419548034668},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.07467687129974365}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/wcsp58612.2023.10404656","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/wcsp58612.2023.10404656","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 International Conference on Wireless Communications and Signal Processing (WCSP)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"},{"id":"https://openalex.org/F4320337504","display_name":"Research and Development","ror":"https://ror.org/027s68j25"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1496108277","https://openalex.org/W1515926918","https://openalex.org/W1594652978","https://openalex.org/W1990605160","https://openalex.org/W2001350036","https://openalex.org/W2036733588","https://openalex.org/W2040075573","https://openalex.org/W2089059832","https://openalex.org/W2090509469","https://openalex.org/W2102386875","https://openalex.org/W2107094606","https://openalex.org/W2134377556","https://openalex.org/W2134732546","https://openalex.org/W2143432773","https://openalex.org/W2148575324","https://openalex.org/W2163882499","https://openalex.org/W2182112064","https://openalex.org/W2327735146","https://openalex.org/W2963700143","https://openalex.org/W3135015857","https://openalex.org/W4251555065","https://openalex.org/W4361861626"],"related_works":["https://openalex.org/W1992183350","https://openalex.org/W2128628822","https://openalex.org/W2361034356","https://openalex.org/W4244153028","https://openalex.org/W1995527419","https://openalex.org/W3021984762","https://openalex.org/W2915572277","https://openalex.org/W2070284141","https://openalex.org/W1978637058","https://openalex.org/W2104186123"],"abstract_inverted_index":{"Finding":[0],"all":[1,39],"roots":[2],"of":[3,102],"polynomials":[4],"over":[5],"finite":[6,43],"fields":[7],"is":[8,82],"a":[9,42,63],"crucial":[10],"problem":[11],"in":[12,41,47],"algebraic":[13],"coding":[14],"techniques,":[15],"such":[16],"as":[17],"decoding":[18],"BCH":[19],"codes":[20],"and":[21,45],"Reed-Solomon":[22],"codes.":[23],"The":[24],"current":[25],"commonly":[26],"used":[27],"methods":[28],"are":[29],"Chien":[30],"search":[31],"or":[32],"fast":[33],"Fourier":[34],"transform":[35],"(FFT),":[36],"which":[37],"evaluates":[38],"elements":[40],"field":[44,48,56,76],"results":[46],"multiplications":[49],"whose":[50],"number":[51],"increases":[52],"linearly":[53],"with":[54,74],"the":[55,68,75,83,92,96],"size.":[57,77],"In":[58],"this":[59,81,89],"paper,":[60],"we":[61],"propose":[62],"new":[64],"approach":[65,94],"that":[66,101],"enables":[67],"multiplicative":[69,86],"complexity":[70,87,98],"to":[71,100],"grow":[72],"sub-linearly":[73],"To":[78],"our":[79],"knowledge,":[80],"currently":[84],"lowest":[85],"for":[88],"problem.":[90],"Additionally,":[91],"proposed":[93],"maintains":[95],"additive":[97],"similar":[99],"FFT-based":[103],"method.":[104]},"counts_by_year":[],"updated_date":"2025-12-21T01:58:51.020947","created_date":"2025-10-10T00:00:00"}