{"id":"https://openalex.org/W2129263384","doi":"https://doi.org/10.1109/ewdts.2013.6673101","title":"A list decoding algorithm for practical reed-solomon codes","display_name":"A list decoding algorithm for practical reed-solomon codes","publication_year":2013,"publication_date":"2013-09-01","ids":{"openalex":"https://openalex.org/W2129263384","doi":"https://doi.org/10.1109/ewdts.2013.6673101","mag":"2129263384"},"language":"en","primary_location":{"id":"doi:10.1109/ewdts.2013.6673101","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ewdts.2013.6673101","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"East-West Design & Test Symposium (EWDTS 2013)","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/A5036965658","display_name":"S. I. Egorov","orcid":"https://orcid.org/0000-0001-5859-1024"},"institutions":[{"id":"https://openalex.org/I95694802","display_name":"South-West State University","ror":"https://ror.org/005ezrx44","country_code":"RU","type":"education","lineage":["https://openalex.org/I95694802"]}],"countries":["RU"],"is_corresponding":true,"raw_author_name":"Sergey Egorov","raw_affiliation_strings":["Department of Computer Engineering, South West State University, Kursk, Russia","Dept. of Comput. Eng., South West State Univ., Kursk, Russia"],"affiliations":[{"raw_affiliation_string":"Department of Computer Engineering, South West State University, Kursk, Russia","institution_ids":["https://openalex.org/I95694802"]},{"raw_affiliation_string":"Dept. of Comput. Eng., South West State Univ., Kursk, Russia","institution_ids":["https://openalex.org/I95694802"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5036965658"],"corresponding_institution_ids":["https://openalex.org/I95694802"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.11259995,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"4"},"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/T11797","display_name":"graph theory and CDMA systems","score":0.996399998664856,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10951","display_name":"Cryptographic Implementations and Security","score":0.9951000213623047,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/berlekamp\u2013welch-algorithm","display_name":"Berlekamp\u2013Welch algorithm","score":0.8983163833618164},{"id":"https://openalex.org/keywords/bcjr-algorithm","display_name":"BCJR algorithm","score":0.7616453170776367},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.7426744103431702},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.7311617136001587},{"id":"https://openalex.org/keywords/reed\u2013solomon-error-correction","display_name":"Reed\u2013Solomon error correction","score":0.6554040908813477},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.6258546710014343},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6246140003204346},{"id":"https://openalex.org/keywords/sequential-decoding","display_name":"Sequential decoding","score":0.5949612855911255},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5172910690307617},{"id":"https://openalex.org/keywords/coding-gain","display_name":"Coding gain","score":0.464078426361084},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.46062201261520386},{"id":"https://openalex.org/keywords/algorithm-design","display_name":"Algorithm design","score":0.46047037839889526},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.436198890209198},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.418709933757782},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.37999314069747925},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.269095778465271}],"concepts":[{"id":"https://openalex.org/C132727834","wikidata":"https://www.wikidata.org/wiki/Q4892328","display_name":"Berlekamp\u2013Welch algorithm","level":5,"score":0.8983163833618164},{"id":"https://openalex.org/C64948573","wikidata":"https://www.wikidata.org/wiki/Q625117","display_name":"BCJR algorithm","level":5,"score":0.7616453170776367},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.7426744103431702},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.7311617136001587},{"id":"https://openalex.org/C78065487","wikidata":"https://www.wikidata.org/wiki/Q1061598","display_name":"Reed\u2013Solomon error correction","level":5,"score":0.6554040908813477},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.6258546710014343},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6246140003204346},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.5949612855911255},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5172910690307617},{"id":"https://openalex.org/C76862118","wikidata":"https://www.wikidata.org/wiki/Q1105671","display_name":"Coding gain","level":3,"score":0.464078426361084},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.46062201261520386},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.46047037839889526},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.436198890209198},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.418709933757782},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.37999314069747925},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.269095778465271},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ewdts.2013.6673101","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ewdts.2013.6673101","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"East-West Design & Test Symposium (EWDTS 2013)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.41999998688697815,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W42469326","https://openalex.org/W1614137482","https://openalex.org/W2018063252","https://openalex.org/W2032431003","https://openalex.org/W2039464200","https://openalex.org/W2066795426","https://openalex.org/W2100852839","https://openalex.org/W6601745702"],"related_works":["https://openalex.org/W1548705449","https://openalex.org/W2359973017","https://openalex.org/W2255105136","https://openalex.org/W2050784748","https://openalex.org/W2247418595","https://openalex.org/W1980817751","https://openalex.org/W2383267581","https://openalex.org/W2010879611","https://openalex.org/W1646172719","https://openalex.org/W2377186915"],"abstract_inverted_index":{"A":[0],"novel":[1],"algorithm":[2,16,25,35,52,57,84],"is":[3,17,30,53,66,71,85],"proposed":[4,34,83],"for":[5,87],"decoding":[6],"of":[7,22,49,61,75,81],"Reed-Solomon":[8],"codes":[9],"beyond":[10],"half":[11],"the":[12,23,33,50,82],"minimum":[13],"distance.":[14],"This":[15],"based":[18],"on":[19],"analytical":[20],"continuation":[21],"Berlekamp-Massey":[24],"through":[26],"additional":[27],"iterations.":[28],"It":[29],"shown":[31,86],"that":[32],"allows":[36],"to":[37,42],"correct":[38],"more":[39],"errors":[40,64],"compared":[41],"Guruswami-Sudan":[43],"(GS)":[44],"algorithm.":[45],"Also":[46],"computational":[47],"complexity":[48,69],"new":[51],"less":[54],"than":[55],"GS":[56],"one":[58],"if":[59],"number":[60],"extra":[62],"correcting":[63],"(\u03c4)":[65],"small.":[67],"Further":[68],"reduction":[70],"achieved":[72],"by":[73],"use":[74],"soft":[76],"decisions.":[77],"The":[78],"coding":[79],"gain":[80],"some":[88],"practical":[89],"codes.":[90]},"counts_by_year":[{"year":2019,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}