{"id":"https://openalex.org/W4386066533","doi":"https://doi.org/10.1109/isit54713.2023.10206584","title":"Efficient Interpolation-Based Decoding of Reed-Solomon Codes","display_name":"Efficient Interpolation-Based Decoding of Reed-Solomon Codes","publication_year":2023,"publication_date":"2023-06-25","ids":{"openalex":"https://openalex.org/W4386066533","doi":"https://doi.org/10.1109/isit54713.2023.10206584"},"language":"en","primary_location":{"id":"doi:10.1109/isit54713.2023.10206584","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/isit54713.2023.10206584","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 IEEE International Symposium on Information Theory (ISIT)","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/A5018519298","display_name":"Wrya K. Kadir","orcid":"https://orcid.org/0000-0002-3981-7195"},"institutions":[{"id":"https://openalex.org/I2799829267","display_name":"Simula Research Laboratory","ror":"https://ror.org/00vn06n10","country_code":"NO","type":"facility","lineage":["https://openalex.org/I2799829267"]},{"id":"https://openalex.org/I4387153661","display_name":"Simula UiB","ror":"https://ror.org/05kmggt55","country_code":null,"type":"nonprofit","lineage":["https://openalex.org/I2799829267","https://openalex.org/I4387153661","https://openalex.org/I4432739"]}],"countries":["NO"],"is_corresponding":true,"raw_author_name":"Wrya K. Kadir","raw_affiliation_strings":["Simula UiB,Bergen,Norway,N-5006"],"affiliations":[{"raw_affiliation_string":"Simula UiB,Bergen,Norway,N-5006","institution_ids":["https://openalex.org/I2799829267","https://openalex.org/I4387153661"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5022827613","display_name":"Hsuan-Yin Lin","orcid":"https://orcid.org/0000-0001-8030-1919"},"institutions":[{"id":"https://openalex.org/I2799829267","display_name":"Simula Research Laboratory","ror":"https://ror.org/00vn06n10","country_code":"NO","type":"facility","lineage":["https://openalex.org/I2799829267"]},{"id":"https://openalex.org/I4387153661","display_name":"Simula UiB","ror":"https://ror.org/05kmggt55","country_code":null,"type":"nonprofit","lineage":["https://openalex.org/I2799829267","https://openalex.org/I4387153661","https://openalex.org/I4432739"]}],"countries":["NO"],"is_corresponding":false,"raw_author_name":"Hsuan-Yin Lin","raw_affiliation_strings":["Simula UiB,Bergen,Norway,N-5006"],"affiliations":[{"raw_affiliation_string":"Simula UiB,Bergen,Norway,N-5006","institution_ids":["https://openalex.org/I2799829267","https://openalex.org/I4387153661"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5090738616","display_name":"Eirik Rosnes","orcid":"https://orcid.org/0000-0001-8236-6601"},"institutions":[{"id":"https://openalex.org/I2799829267","display_name":"Simula Research Laboratory","ror":"https://ror.org/00vn06n10","country_code":"NO","type":"facility","lineage":["https://openalex.org/I2799829267"]},{"id":"https://openalex.org/I4387153661","display_name":"Simula UiB","ror":"https://ror.org/05kmggt55","country_code":null,"type":"nonprofit","lineage":["https://openalex.org/I2799829267","https://openalex.org/I4387153661","https://openalex.org/I4432739"]}],"countries":["NO"],"is_corresponding":false,"raw_author_name":"Eirik Rosnes","raw_affiliation_strings":["Simula UiB,Bergen,Norway,N-5006"],"affiliations":[{"raw_affiliation_string":"Simula UiB,Bergen,Norway,N-5006","institution_ids":["https://openalex.org/I2799829267","https://openalex.org/I4387153661"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5018519298"],"corresponding_institution_ids":["https://openalex.org/I2799829267","https://openalex.org/I4387153661"],"apc_list":null,"apc_paid":null,"fwci":0.5305,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.71879469,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"997","last_page":"1002"},"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.9925000071525574,"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.9900000095367432,"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/circulant-matrix","display_name":"Circulant matrix","score":0.7606492638587952},{"id":"https://openalex.org/keywords/fast-fourier-transform","display_name":"Fast Fourier transform","score":0.7221178412437439},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6813019514083862},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.6799221634864807},{"id":"https://openalex.org/keywords/finite-field","display_name":"Finite field","score":0.5984412431716919},{"id":"https://openalex.org/keywords/interpolation","display_name":"Interpolation (computer graphics)","score":0.5518985390663147},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.5460772514343262},{"id":"https://openalex.org/keywords/reed\u2013solomon-error-correction","display_name":"Reed\u2013Solomon error correction","score":0.5159452557563782},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5019655227661133},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.477193683385849},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.45217445492744446},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.42661598324775696},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.41601240634918213},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4102247953414917},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.40411972999572754},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.1668809950351715},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.13070222735404968},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.06485316157341003},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.06109893321990967}],"concepts":[{"id":"https://openalex.org/C115973184","wikidata":"https://www.wikidata.org/wiki/Q245457","display_name":"Circulant matrix","level":2,"score":0.7606492638587952},{"id":"https://openalex.org/C75172450","wikidata":"https://www.wikidata.org/wiki/Q623950","display_name":"Fast Fourier transform","level":2,"score":0.7221178412437439},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6813019514083862},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.6799221634864807},{"id":"https://openalex.org/C77926391","wikidata":"https://www.wikidata.org/wiki/Q603880","display_name":"Finite field","level":2,"score":0.5984412431716919},{"id":"https://openalex.org/C137800194","wikidata":"https://www.wikidata.org/wiki/Q11713455","display_name":"Interpolation (computer graphics)","level":3,"score":0.5518985390663147},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.5460772514343262},{"id":"https://openalex.org/C78065487","wikidata":"https://www.wikidata.org/wiki/Q1061598","display_name":"Reed\u2013Solomon error correction","level":5,"score":0.5159452557563782},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5019655227661133},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.477193683385849},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.45217445492744446},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.42661598324775696},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.41601240634918213},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4102247953414917},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40411972999572754},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1668809950351715},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.13070222735404968},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.06485316157341003},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.06109893321990967},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C126042441","wikidata":"https://www.wikidata.org/wiki/Q1324888","display_name":"Frame (networking)","level":2,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit54713.2023.10206584","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/isit54713.2023.10206584","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 IEEE International Symposium on Information Theory (ISIT)","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":27,"referenced_works":["https://openalex.org/W58580312","https://openalex.org/W966573063","https://openalex.org/W1496108277","https://openalex.org/W1907666253","https://openalex.org/W1966214710","https://openalex.org/W1984265227","https://openalex.org/W1990304797","https://openalex.org/W2001224529","https://openalex.org/W2016833807","https://openalex.org/W2047089385","https://openalex.org/W2093009396","https://openalex.org/W2120176967","https://openalex.org/W2136570131","https://openalex.org/W2148575324","https://openalex.org/W2154220188","https://openalex.org/W2162442687","https://openalex.org/W2167511540","https://openalex.org/W2519202371","https://openalex.org/W2963700143","https://openalex.org/W3045045786","https://openalex.org/W3196641868","https://openalex.org/W3212658235","https://openalex.org/W4205630623","https://openalex.org/W4210992409","https://openalex.org/W4231896027","https://openalex.org/W4307203247","https://openalex.org/W6999579170"],"related_works":["https://openalex.org/W2133789648","https://openalex.org/W3101821486","https://openalex.org/W2146067565","https://openalex.org/W2247418595","https://openalex.org/W2176772360","https://openalex.org/W2765921567","https://openalex.org/W10380459","https://openalex.org/W2949501833","https://openalex.org/W2121777163","https://openalex.org/W2625239423"],"abstract_inverted_index":{"We":[0],"propose":[1],"a":[2,14,47],"new":[3],"interpolation-based":[4],"error":[5,53],"decoding":[6,65,118],"algorithm":[7,74],"for":[8,75,121],"(n,k)":[9,88],"Reed-Solomon":[10],"(RS)":[11],"codes":[12],"over":[13,105],"finite":[15,109],"field":[16],"of":[17,46,71,92,125],"size":[18],"q,":[19],"where":[20],"n":[21],"=":[22],"q":[23],"\u2212":[24],"1":[25],"is":[26,31,91],"the":[27,32,38,52,64,72,113,122],"length":[28],"and":[29,56,98,107],"k":[30],"dimension.":[33],"In":[34],"particular,":[35],"we":[36],"employ":[37],"fast":[39],"Fourier":[40],"transform":[41],"(FFT)":[42],"together":[43],"with":[44,51],"properties":[45],"circulant":[48],"matrix":[49],"associated":[50],"interpolation":[54],"polynomial":[55],"some":[57],"known":[58,116],"results":[59],"from":[60],"elimination":[61],"theory":[62],"in":[63,86],"process.":[66],"The":[67],"asymptotic":[68,117],"computational":[69],"complexity":[70],"proposed":[73,120],"correcting":[76],"any":[77],"$t":[78],"\\leq":[79],"\\left\\lfloor":[80],"{\\frac{{n":[81],"-":[82],"k}}{2}}":[83],"\\right\\rfloor$":[84],"errors":[85],"an":[87],"RS":[89],"code":[90],"order":[93],"${\\mathcal{O}}\\left(":[94,99],"{t{{\\log":[95],"}^2}t}":[96],"\\right)$":[97,104],"{n{{\\log":[100],"}^2}n\\log":[101],"\\log":[102],"n}":[103],"FFT-friendly":[106],"arbitrary":[108],"fields,":[110],"respectively,":[111],"achieving":[112],"best":[114],"currently":[115],"complexity,":[119],"same":[123],"set":[124],"parameters.":[126]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2}],"updated_date":"2026-03-11T06:11:40.159057","created_date":"2025-10-10T00:00:00"}