{"id":"https://openalex.org/W7128526709","doi":"https://doi.org/10.1109/tcomm.2026.3663509","title":"Efficient Encoding/Decoding Algorithms for Irreducible Polynomial Remainder Codes via Additive FFT","display_name":"Efficient Encoding/Decoding Algorithms for Irreducible Polynomial Remainder Codes via Additive FFT","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7128526709","doi":"https://doi.org/10.1109/tcomm.2026.3663509"},"language":null,"primary_location":{"id":"doi:10.1109/tcomm.2026.3663509","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tcomm.2026.3663509","pdf_url":null,"source":{"id":"https://openalex.org/S196647941","display_name":"IEEE Transactions on Communications","issn_l":"0090-6778","issn":["0090-6778","1558-0857"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310316002","host_organization_name":"IEEE Communications Society","host_organization_lineage":["https://openalex.org/P4310316002","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Communications Society","Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Communications","raw_type":"journal-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":null,"display_name":"Wenhao Liu","orcid":"https://orcid.org/0009-0002-9747-2225"},"institutions":[{"id":"https://openalex.org/I99065089","display_name":"Tsinghua University","ror":"https://ror.org/03cve4549","country_code":"CN","type":"education","lineage":["https://openalex.org/I99065089"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Wenhao Liu","raw_affiliation_strings":["Department of Mathematical Sciences, Tsinghua University, Beijing, China"],"raw_orcid":"https://orcid.org/0009-0002-9747-2225","affiliations":[{"raw_affiliation_string":"Department of Mathematical Sciences, Tsinghua University, Beijing, China","institution_ids":["https://openalex.org/I99065089"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5114734261","display_name":"Zhengyi Jiang","orcid":"https://orcid.org/0000-0002-2060-1108"},"institutions":[{"id":"https://openalex.org/I99065089","display_name":"Tsinghua University","ror":"https://ror.org/03cve4549","country_code":"CN","type":"education","lineage":["https://openalex.org/I99065089"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Zhengyi Jiang","raw_affiliation_strings":["Department of Mathematical Sciences, Tsinghua University, Beijing, China"],"raw_orcid":"https://orcid.org/0000-0002-2060-1108","affiliations":[{"raw_affiliation_string":"Department of Mathematical Sciences, Tsinghua University, Beijing, China","institution_ids":["https://openalex.org/I99065089"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Zhongyi Huang","orcid":"https://orcid.org/0000-0002-5623-4864"},"institutions":[{"id":"https://openalex.org/I99065089","display_name":"Tsinghua University","ror":"https://ror.org/03cve4549","country_code":"CN","type":"education","lineage":["https://openalex.org/I99065089"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Zhongyi Huang","raw_affiliation_strings":["Department of Mathematical Sciences, Tsinghua University, Beijing, China"],"raw_orcid":"https://orcid.org/0000-0002-5623-4864","affiliations":[{"raw_affiliation_string":"Department of Mathematical Sciences, Tsinghua University, Beijing, China","institution_ids":["https://openalex.org/I99065089"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5102671361","display_name":"Weitao Xu","orcid":null},"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":"Weitao Xu","raw_affiliation_strings":["Department of Computer Science, City University of Hong Kong, Hong Kong, China"],"raw_orcid":"https://orcid.org/0000-0001-9741-5912","affiliations":[{"raw_affiliation_string":"Department of Computer Science, City University of Hong Kong, Hong Kong, China","institution_ids":["https://openalex.org/I168719708"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5121016176","display_name":"Linqi Song","orcid":null},"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":["Department of Computer Science, City University of Hong Kong, Hong Kong, China"],"raw_orcid":"https://orcid.org/0000-0003-2756-4984","affiliations":[{"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/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":false,"raw_author_name":"Hanxu Hou","raw_affiliation_strings":["Dongguan University of Technology, Dongguan, China"],"raw_orcid":"https://orcid.org/0000-0001-7328-9341","affiliations":[{"raw_affiliation_string":"Dongguan University of Technology, Dongguan, China","institution_ids":["https://openalex.org/I2799850029"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.14231936,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"74","issue":null,"first_page":"5574","last_page":"5589"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.9632999897003174,"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.9632999897003174,"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/T11693","display_name":"Cryptography and Residue Arithmetic","score":0.010200000368058681,"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"}},{"id":"https://openalex.org/T11435","display_name":"Polynomial and algebraic computation","score":0.008700000122189522,"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/chinese-remainder-theorem","display_name":"Chinese remainder theorem","score":0.8402000069618225},{"id":"https://openalex.org/keywords/remainder","display_name":"Remainder","score":0.708299994468689},{"id":"https://openalex.org/keywords/coprime-integers","display_name":"Coprime integers","score":0.5406000018119812},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.5177000164985657},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.45559999346733093},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.429500013589859},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4099999964237213},{"id":"https://openalex.org/keywords/discrete-fourier-transform","display_name":"Discrete Fourier transform (general)","score":0.39969998598098755},{"id":"https://openalex.org/keywords/cyclic-code","display_name":"Cyclic code","score":0.3991999924182892}],"concepts":[{"id":"https://openalex.org/C151635116","wikidata":"https://www.wikidata.org/wiki/Q193878","display_name":"Chinese remainder theorem","level":2,"score":0.8402000069618225},{"id":"https://openalex.org/C39613435","wikidata":"https://www.wikidata.org/wiki/Q846677","display_name":"Remainder","level":2,"score":0.708299994468689},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6500999927520752},{"id":"https://openalex.org/C23230895","wikidata":"https://www.wikidata.org/wiki/Q104752","display_name":"Coprime integers","level":2,"score":0.5406000018119812},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.5177000164985657},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4797999858856201},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.45559999346733093},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.45559999346733093},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.429500013589859},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4099999964237213},{"id":"https://openalex.org/C57733114","wikidata":"https://www.wikidata.org/wiki/Q1006032","display_name":"Discrete Fourier transform (general)","level":5,"score":0.39969998598098755},{"id":"https://openalex.org/C2096984","wikidata":"https://www.wikidata.org/wiki/Q245464","display_name":"Cyclic code","level":5,"score":0.3991999924182892},{"id":"https://openalex.org/C75172450","wikidata":"https://www.wikidata.org/wiki/Q623950","display_name":"Fast Fourier transform","level":2,"score":0.3474999964237213},{"id":"https://openalex.org/C165030954","wikidata":"https://www.wikidata.org/wiki/Q1476663","display_name":"Irreducible polynomial","level":4,"score":0.3474000096321106},{"id":"https://openalex.org/C77926391","wikidata":"https://www.wikidata.org/wiki/Q603880","display_name":"Finite field","level":2,"score":0.3458000123500824},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.34040001034736633},{"id":"https://openalex.org/C39635130","wikidata":"https://www.wikidata.org/wiki/Q7226636","display_name":"Polynomial code","level":5,"score":0.3345000147819519},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.3301999866962433},{"id":"https://openalex.org/C42747912","wikidata":"https://www.wikidata.org/wiki/Q1048447","display_name":"Multiplicative function","level":2,"score":0.32589998841285706},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.3050000071525574},{"id":"https://openalex.org/C78065487","wikidata":"https://www.wikidata.org/wiki/Q1061598","display_name":"Reed\u2013Solomon error correction","level":5,"score":0.3012999892234802},{"id":"https://openalex.org/C15376144","wikidata":"https://www.wikidata.org/wiki/Q2989575","display_name":"Irreducible element","level":5,"score":0.2939999997615814},{"id":"https://openalex.org/C132727834","wikidata":"https://www.wikidata.org/wiki/Q4892328","display_name":"Berlekamp\u2013Welch algorithm","level":5,"score":0.29100000858306885},{"id":"https://openalex.org/C43060483","wikidata":"https://www.wikidata.org/wiki/Q17006372","display_name":"Cyclotomic fast Fourier transform","level":5,"score":0.2872999906539917},{"id":"https://openalex.org/C106286213","wikidata":"https://www.wikidata.org/wiki/Q898572","display_name":"Matroid","level":2,"score":0.28519999980926514},{"id":"https://openalex.org/C173259116","wikidata":"https://www.wikidata.org/wiki/Q864003","display_name":"Discrete logarithm","level":4,"score":0.2700999975204468},{"id":"https://openalex.org/C7720571","wikidata":"https://www.wikidata.org/wiki/Q1136880","display_name":"Power of two","level":2,"score":0.25380000472068787},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.25369998812675476},{"id":"https://openalex.org/C113709454","wikidata":"https://www.wikidata.org/wiki/Q602136","display_name":"Coding theory","level":2,"score":0.2535000145435333}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tcomm.2026.3663509","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tcomm.2026.3663509","pdf_url":null,"source":{"id":"https://openalex.org/S196647941","display_name":"IEEE Transactions on Communications","issn_l":"0090-6778","issn":["0090-6778","1558-0857"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310316002","host_organization_name":"IEEE Communications Society","host_organization_lineage":["https://openalex.org/P4310316002","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Communications Society","Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Communications","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1126705714","display_name":"\u673a\u67b6\u7ed3\u6784\u6570\u636e\u4e2d\u5fc3\u7684\u9ad8\u6027\u80fd\u5b58\u50a8\u7f16\u7801\u7814\u7a76","funder_award_id":"62071121","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"},{"id":"https://openalex.org/G3643945900","display_name":null,"funder_award_id":"62371411","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"},{"id":"https://openalex.org/G6144354176","display_name":null,"funder_award_id":"12025104","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"},{"id":"https://openalex.org/G8965963615","display_name":null,"funder_award_id":"2020YFA0712300","funder_id":"https://openalex.org/F4320335777","funder_display_name":"National Key Research and Development Program of China"}],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"},{"id":"https://openalex.org/F4320335777","display_name":"National Key Research and Development Program of China","ror":null}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Polynomial":[0],"remainder":[1,30,54,215],"codes":[2,8,21,31,55],"form":[3],"a":[4,23,72,129,145,154,203],"class":[5],"of":[6,75,131,147],"linear":[7],"constructed":[9],"based":[10],"on":[11],"the":[12,35,61,99,105,136,166,210],"Chinese":[13],"Remainder":[14],"Theorem":[15],"over":[16,56],"polynomial":[17,29,53,214],"rings,":[18],"with":[19,104,161,175],"Reed-Solomon":[20],"as":[22],"special":[24],"case.":[25],"In":[26],"particular,":[27],"irreducible":[28,40,52],"are":[32,37],"those":[33],"where":[34,90],"moduli":[36],"pairwise":[38],"coprime":[39],"polynomials.":[41],"This":[42,133],"paper":[43],"presents":[44],"an":[45,193],"efficient":[46],"encoding":[47,201],"and":[48,94,102,120,183,202],"decoding":[49,207],"method":[50,191],"for":[51,140,200,206,213],"F<sub":[57],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[58,77,79,82,84,88,92,96,110,114,118,122,126,149,179,186],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">2<i><sup>m</sup></i></sub>,":[59],"leveraging":[60],"additive":[62],"Fast":[63],"Fourier":[64],"Transform":[65],"(additive":[66],"FFT).":[67],"The":[68],"proposed":[69,167],"approach":[70,212],"achieves":[71,192],"computational":[73,171],"complexity":[74,146,156,199],"<italic":[76,87,91,95,109,113,121,125,148,178,185],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">O</i>(<italic":[78],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">N</i>":[80,85,93,111,123,180],"log<sup":[81],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">2</sup>(<italic":[83],"\u2212":[86,112,124],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">K</i>)),":[89],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">K</i>":[97,115,127,187],"denote":[98],"code":[100,176],"length":[101,177],"dimension,":[103],"additional":[106],"requirement":[107],"that":[108,165],"<":[116],"2<sup":[117],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">m\u22121</sup>":[119],"is":[128],"power":[130],"2.":[132],"substantially":[134],"outperforms":[135],"best":[137],"known":[138],"algorithm":[139],"such":[141],"codes,":[142],"which":[143],"has":[144],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">O(N<sup>2</sup>)</i>.":[150],"Furthermore,":[151],"we":[152],"conduct":[153],"non-asymptotic":[155],"comparison":[157],"under":[158],"specific":[159],"parameters,":[160],"numerical":[162],"results":[163],"demonstrating":[164],"algorithms":[168],"effectively":[169],"reduces":[170],"complexity.":[172],"For":[173],"example,":[174],"=":[181,188],"256":[182],"dimension":[184],"224,":[189],"our":[190],"approximately":[194],"83%":[195],"reduction":[196,205],"in":[197],"multiplicative":[198],"50%":[204],"compared":[208],"to":[209],"state-of-the-art":[211],"codes.":[216]},"counts_by_year":[],"updated_date":"2026-03-06T06:45:51.903784","created_date":"2026-02-11T00:00:00"}