{"id":"https://openalex.org/W2003191755","doi":"https://doi.org/10.1109/tsp.2012.2192435","title":"Reduced-Complexity Decoders of Long Reed-Solomon Codes Based on Composite Cyclotomic Fourier Transforms","display_name":"Reduced-Complexity Decoders of Long Reed-Solomon Codes Based on Composite Cyclotomic Fourier Transforms","publication_year":2012,"publication_date":"2012-04-11","ids":{"openalex":"https://openalex.org/W2003191755","doi":"https://doi.org/10.1109/tsp.2012.2192435","mag":"2003191755"},"language":"en","primary_location":{"id":"doi:10.1109/tsp.2012.2192435","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tsp.2012.2192435","pdf_url":null,"source":{"id":"https://openalex.org/S168680287","display_name":"IEEE Transactions on Signal Processing","issn_l":"1053-587X","issn":["1053-587X","1941-0476"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["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 Signal Processing","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1108.2893","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5013653082","display_name":"Xuebin Wu","orcid":null},"institutions":[{"id":"https://openalex.org/I186143895","display_name":"Lehigh University","ror":"https://ror.org/012afjb06","country_code":"US","type":"education","lineage":["https://openalex.org/I186143895"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Xuebin Wu","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Lehigh University, PA, USA","LSI Corporation, Milpitas, CA, USA","[Dept. of Electr. & Comput. Eng., Lehigh Univ., Bethlehem, PA, USA]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Lehigh University, PA, USA","institution_ids":["https://openalex.org/I186143895"]},{"raw_affiliation_string":"LSI Corporation, Milpitas, CA, USA","institution_ids":[]},{"raw_affiliation_string":"[Dept. of Electr. & Comput. Eng., Lehigh Univ., Bethlehem, PA, USA]","institution_ids":["https://openalex.org/I186143895"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101582861","display_name":"Zhiyuan Yan","orcid":"https://orcid.org/0000-0003-2286-2771"},"institutions":[{"id":"https://openalex.org/I186143895","display_name":"Lehigh University","ror":"https://ror.org/012afjb06","country_code":"US","type":"education","lineage":["https://openalex.org/I186143895"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Zhiyuan Yan","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Lehigh University, PA, USA","[Dept. of Electr. & Comput. Eng., Lehigh Univ., Bethlehem, PA, USA]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Lehigh University, PA, USA","institution_ids":["https://openalex.org/I186143895"]},{"raw_affiliation_string":"[Dept. of Electr. & Comput. Eng., Lehigh Univ., Bethlehem, PA, USA]","institution_ids":["https://openalex.org/I186143895"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5019940239","display_name":"Jun Lin","orcid":"https://orcid.org/0000-0003-2760-4333"},"institutions":[{"id":"https://openalex.org/I186143895","display_name":"Lehigh University","ror":"https://ror.org/012afjb06","country_code":"US","type":"education","lineage":["https://openalex.org/I186143895"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jun Lin","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Lehigh University, PA, USA","[Dept. of Electr. & Comput. Eng., Lehigh Univ., Bethlehem, PA, USA]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Lehigh University, PA, USA","institution_ids":["https://openalex.org/I186143895"]},{"raw_affiliation_string":"[Dept. of Electr. & Comput. Eng., Lehigh Univ., Bethlehem, PA, USA]","institution_ids":["https://openalex.org/I186143895"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I186143895"],"apc_list":null,"apc_paid":null,"fwci":0.4349,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.71426329,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"60","issue":"7","first_page":"3920","last_page":"3925"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":1.0,"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":1.0,"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/T10951","display_name":"Cryptographic Implementations and Security","score":0.9955000281333923,"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.992900013923645,"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/computational-complexity-theory","display_name":"Computational complexity theory","score":0.6053338646888733},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5931612253189087},{"id":"https://openalex.org/keywords/fast-fourier-transform","display_name":"Fast Fourier transform","score":0.590937614440918},{"id":"https://openalex.org/keywords/discrete-fourier-transform","display_name":"Discrete Fourier transform (general)","score":0.5553728342056274},{"id":"https://openalex.org/keywords/reed\u2013solomon-error-correction","display_name":"Reed\u2013Solomon error correction","score":0.5127893090248108},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.5115826725959778},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.49831581115722656},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.48341500759124756},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.47950059175491333},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.47499409317970276},{"id":"https://openalex.org/keywords/finite-field","display_name":"Finite field","score":0.4646014869213104},{"id":"https://openalex.org/keywords/modular-design","display_name":"Modular design","score":0.4345674514770508},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4127601385116577},{"id":"https://openalex.org/keywords/fourier-transform","display_name":"Fourier transform","score":0.37195900082588196},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3703846335411072},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.3660207986831665},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.30406874418258667},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2923624515533447},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.1476481854915619},{"id":"https://openalex.org/keywords/fourier-analysis","display_name":"Fourier analysis","score":0.12584984302520752}],"concepts":[{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.6053338646888733},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5931612253189087},{"id":"https://openalex.org/C75172450","wikidata":"https://www.wikidata.org/wiki/Q623950","display_name":"Fast Fourier transform","level":2,"score":0.590937614440918},{"id":"https://openalex.org/C57733114","wikidata":"https://www.wikidata.org/wiki/Q1006032","display_name":"Discrete Fourier transform (general)","level":5,"score":0.5553728342056274},{"id":"https://openalex.org/C78065487","wikidata":"https://www.wikidata.org/wiki/Q1061598","display_name":"Reed\u2013Solomon error correction","level":5,"score":0.5127893090248108},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.5115826725959778},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.49831581115722656},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.48341500759124756},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.47950059175491333},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.47499409317970276},{"id":"https://openalex.org/C77926391","wikidata":"https://www.wikidata.org/wiki/Q603880","display_name":"Finite field","level":2,"score":0.4646014869213104},{"id":"https://openalex.org/C101468663","wikidata":"https://www.wikidata.org/wiki/Q1620158","display_name":"Modular design","level":2,"score":0.4345674514770508},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4127601385116577},{"id":"https://openalex.org/C102519508","wikidata":"https://www.wikidata.org/wiki/Q6520159","display_name":"Fourier transform","level":2,"score":0.37195900082588196},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3703846335411072},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.3660207986831665},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.30406874418258667},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2923624515533447},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.1476481854915619},{"id":"https://openalex.org/C203024314","wikidata":"https://www.wikidata.org/wiki/Q1365258","display_name":"Fourier analysis","level":3,"score":0.12584984302520752},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0},{"id":"https://openalex.org/C76563020","wikidata":"https://www.wikidata.org/wiki/Q4817582","display_name":"Fractional Fourier transform","level":4,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/tsp.2012.2192435","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tsp.2012.2192435","pdf_url":null,"source":{"id":"https://openalex.org/S168680287","display_name":"IEEE Transactions on Signal Processing","issn_l":"1053-587X","issn":["1053-587X","1941-0476"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["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 Signal Processing","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1108.2893","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1108.2893","pdf_url":"https://arxiv.org/pdf/1108.2893","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1108.2893","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1108.2893","pdf_url":"https://arxiv.org/pdf/1108.2893","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W108632488","https://openalex.org/W1528935082","https://openalex.org/W1593683169","https://openalex.org/W1980822076","https://openalex.org/W1992406028","https://openalex.org/W2030571394","https://openalex.org/W2061171222","https://openalex.org/W2114813128","https://openalex.org/W2116872958","https://openalex.org/W2126570377","https://openalex.org/W2131011765","https://openalex.org/W2150444808","https://openalex.org/W2152096493","https://openalex.org/W2904838066","https://openalex.org/W3032516982","https://openalex.org/W3100826625","https://openalex.org/W4231896027","https://openalex.org/W4285719527","https://openalex.org/W6677545880"],"related_works":["https://openalex.org/W135568846","https://openalex.org/W2460434904","https://openalex.org/W1789159349","https://openalex.org/W2113911300","https://openalex.org/W2151857680","https://openalex.org/W2556147571","https://openalex.org/W3088883112","https://openalex.org/W2060062708","https://openalex.org/W1798117689","https://openalex.org/W2293846540"],"abstract_inverted_index":{"Long":[0],"Reed-Solomon":[1],"(RS)":[2],"codes":[3,86],"are":[4,50],"desirable":[5],"for":[6,61,83,109,125],"digital":[7],"communication":[8],"and":[9,77,142],"storage":[10],"systems":[11],"due":[12],"to":[13,30,115],"their":[14,24,31],"improved":[15],"error":[16],"performance,":[17],"but":[18],"the":[19,54],"high":[20],"computational":[21,55,107],"complexity":[22],"of":[23,57,106],"decoders":[25,60,82,97],"is":[26],"a":[27,42,103,126],"key":[28],"obstacle":[29],"adoption":[32],"in":[33,52],"practice.":[34],"As":[35],"discrete":[36],"Fourier":[37,74],"transforms":[38,75],"(DFTs)":[39],"can":[40],"evaluate":[41],"polynomial":[43],"at":[44],"multiple":[45],"points,":[46],"efficient":[47],"DFT":[48],"algorithms":[49],"promising":[51],"reducing":[53],"complexities":[56,108],"syndrome":[58,80],"based":[59,81,91,98,118],"long":[62,84,110],"RS":[63,85,111,130],"codes.":[64,112],"In":[65,113],"this":[66],"correspondence,":[67],"we":[68],"first":[69],"propose":[70],"partial":[71,93,100],"composite":[72],"cyclotomic":[73],"(CCFTs)":[76],"then":[78],"devise":[79],"over":[87,132],"large":[88],"finite":[89],"fields":[90],"on":[92,99,119],"CCFTs.":[94],"The":[95],"new":[96],"CCFTs":[101],"achieve":[102],"significant":[104],"saving":[105],"comparison":[114],"previous":[116],"results":[117],"Horner's":[120],"rule,":[121],"our":[122],"hardware":[123],"implementation":[124],"(2720,":[127],"2550)":[128],"shortened":[129],"code":[131],"GF(2":[133],"<sup":[134],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[135],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">12</sup>":[136],")":[137],"achieves":[138],"much":[139],"higher":[140],"throughputs":[141],"better":[143],"area-time":[144],"complexity.":[145]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2016-06-24T00:00:00"}