{"id":"https://openalex.org/W3000170011","doi":"https://doi.org/10.1109/lcomm.2020.2965453","title":"Fast Encoding and Decoding Algorithms for Arbitrary $(n,k)$ Reed-Solomon Codes Over $\\mathbb{F}_{2^m}$","display_name":"Fast Encoding and Decoding Algorithms for Arbitrary $(n,k)$ Reed-Solomon Codes Over $\\mathbb{F}_{2^m}$","publication_year":2020,"publication_date":"2020-01-10","ids":{"openalex":"https://openalex.org/W3000170011","doi":"https://doi.org/10.1109/lcomm.2020.2965453","mag":"3000170011"},"language":"en","primary_location":{"id":"doi:10.1109/lcomm.2020.2965453","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lcomm.2020.2965453","pdf_url":null,"source":{"id":"https://openalex.org/S147316732","display_name":"IEEE Communications Letters","issn_l":"1089-7798","issn":["1089-7798","1558-2558","2373-7891"],"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 Communications Letters","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":"https://openalex.org/A5058574115","display_name":"Nianqi Tang","orcid":"https://orcid.org/0000-0001-8460-3527"},"institutions":[{"id":"https://openalex.org/I2250955327","display_name":"Huawei Technologies (China)","ror":"https://ror.org/00cmhce21","country_code":"CN","type":"company","lineage":["https://openalex.org/I2250955327"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Nianqi Tang","raw_affiliation_strings":["Huawei Technologies Company Ltd., Shenzhen, China"],"affiliations":[{"raw_affiliation_string":"Huawei Technologies Company Ltd., Shenzhen, China","institution_ids":["https://openalex.org/I2250955327"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5110661690","display_name":"Yun Lin","orcid":null},"institutions":[{"id":"https://openalex.org/I2250955327","display_name":"Huawei Technologies (China)","ror":"https://ror.org/00cmhce21","country_code":"CN","type":"company","lineage":["https://openalex.org/I2250955327"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yun Lin","raw_affiliation_strings":["Huawei Technologies Company Ltd., Shenzhen, China"],"affiliations":[{"raw_affiliation_string":"Huawei Technologies Company Ltd., Shenzhen, China","institution_ids":["https://openalex.org/I2250955327"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5058574115"],"corresponding_institution_ids":["https://openalex.org/I2250955327"],"apc_list":null,"apc_paid":null,"fwci":1.4582,"has_fulltext":false,"cited_by_count":19,"citation_normalized_percentile":{"value":0.85437025,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":93,"max":98},"biblio":{"volume":"24","issue":"4","first_page":"716","last_page":"719"},"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.9955999851226807,"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.9944999814033508,"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/decoding-methods","display_name":"Decoding methods","score":0.7457221746444702},{"id":"https://openalex.org/keywords/fast-fourier-transform","display_name":"Fast Fourier transform","score":0.7306501865386963},{"id":"https://openalex.org/keywords/reed\u2013solomon-error-correction","display_name":"Reed\u2013Solomon error correction","score":0.6841090321540833},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.6326649785041809},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5976924896240234},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.5698049664497375},{"id":"https://openalex.org/keywords/berlekamp\u2013welch-algorithm","display_name":"Berlekamp\u2013Welch algorithm","score":0.5154898762702942},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5093272924423218},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.4492361843585968},{"id":"https://openalex.org/keywords/sequential-decoding","display_name":"Sequential decoding","score":0.4025207757949829},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.40123844146728516},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3263632655143738},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.2962164878845215},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.21716171503067017}],"concepts":[{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.7457221746444702},{"id":"https://openalex.org/C75172450","wikidata":"https://www.wikidata.org/wiki/Q623950","display_name":"Fast Fourier transform","level":2,"score":0.7306501865386963},{"id":"https://openalex.org/C78065487","wikidata":"https://www.wikidata.org/wiki/Q1061598","display_name":"Reed\u2013Solomon error correction","level":5,"score":0.6841090321540833},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.6326649785041809},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5976924896240234},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.5698049664497375},{"id":"https://openalex.org/C132727834","wikidata":"https://www.wikidata.org/wiki/Q4892328","display_name":"Berlekamp\u2013Welch algorithm","level":5,"score":0.5154898762702942},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5093272924423218},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.4492361843585968},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.4025207757949829},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.40123844146728516},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3263632655143738},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.2962164878845215},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.21716171503067017},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/lcomm.2020.2965453","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lcomm.2020.2965453","pdf_url":null,"source":{"id":"https://openalex.org/S147316732","display_name":"IEEE Communications Letters","issn_l":"1089-7798","issn":["1089-7798","1558-2558","2373-7891"],"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 Communications Letters","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","score":0.44999998807907104,"display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W1966214710","https://openalex.org/W2519202371","https://openalex.org/W2744993501","https://openalex.org/W2963700143"],"related_works":["https://openalex.org/W2385322349","https://openalex.org/W2247418595","https://openalex.org/W2050784748","https://openalex.org/W2359973017","https://openalex.org/W1548705449","https://openalex.org/W1646172719","https://openalex.org/W2952366650","https://openalex.org/W2134912618","https://openalex.org/W4299903797","https://openalex.org/W2744658369"],"abstract_inverted_index":{"Recently,":[0],"a":[1],"new":[2,89],"polynomial":[3],"basis":[4],"over":[5],"finite":[6],"fields":[7],"was":[8],"proposed":[9],"such":[10],"that":[11,55],"the":[12,16,28,44,49,56,60,75,93],"computational":[13,46],"complexity":[14,47,96],"of":[15,62,68],"fast":[17],"Fourier":[18],"transform":[19],"(FFT)":[20],"is":[21],"O(n":[22],"log":[23],"n).":[24],"Based":[25],"on":[26,85],"FFTs,":[27],"encoding":[29,76],"and":[30,59,77],"decoding":[31,78],"algorithms":[32,53,79,90],"for":[33,80],"Reed-Solomon":[34],"(RS)":[35],"codes":[36,83],"were":[37],"proposed,":[38],"which":[39],"are":[40],"shown":[41],"to":[42],"have":[43],"lowest":[45],"in":[48],"literature.":[50],"However,":[51],"these":[52,88],"require":[54],"code":[57],"length":[58],"number":[61],"parity":[63],"symbols":[64],"must":[65],"be":[66],"power":[67],"two.":[69],"In":[70],"this":[71],"letter,":[72],"we":[73],"present":[74],"arbitrary":[81],"RS":[82],"based":[84],"FFTs.":[86],"Furthermore,":[87],"also":[91],"reach":[92],"best":[94],"known":[95],"bound.":[97]},"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":6},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}