{"id":"https://openalex.org/W2068088201","doi":"https://doi.org/10.1109/icc.2004.1312582","title":"An algorithm for t+1 error correction in Reed-Solomon codes","display_name":"An algorithm for t+1 error correction in Reed-Solomon codes","publication_year":2004,"publication_date":"2004-01-01","ids":{"openalex":"https://openalex.org/W2068088201","doi":"https://doi.org/10.1109/icc.2004.1312582","mag":"2068088201"},"language":"en","primary_location":{"id":"doi:10.1109/icc.2004.1312582","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icc.2004.1312582","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577)","raw_type":"proceedings-article"},"type":"conference-paper","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":false,"raw_author_name":"S.I. Egorov","raw_affiliation_strings":["Department of Computer Engineering, Kursk State Technical University, Kursk, Russia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Engineering, Kursk State Technical University, Kursk, Russia","institution_ids":["https://openalex.org/I95694802"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5046761666","display_name":"Garik Markarian","orcid":"https://orcid.org/0000-0002-2390-610X"},"institutions":[{"id":"https://openalex.org/I130828816","display_name":"University of Leeds","ror":"https://ror.org/024mrxd33","country_code":"GB","type":"education","lineage":["https://openalex.org/I130828816"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"G. Markarian","raw_affiliation_strings":["Department of Electrical and Electronics Engineering, University of Leeds, Leeds, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Electronics Engineering, University of Leeds, Leeds, UK","institution_ids":["https://openalex.org/I130828816"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"651","last_page":"655 Vol.2"},"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.998199999332428,"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.9980000257492065,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/reed\u2013solomon-error-correction","display_name":"Reed\u2013Solomon error correction","score":0.7266235947608948},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.725982666015625},{"id":"https://openalex.org/keywords/berlekamp\u2013welch-algorithm","display_name":"Berlekamp\u2013Welch algorithm","score":0.7136769890785217},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.6541496515274048},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6362248659133911},{"id":"https://openalex.org/keywords/bcjr-algorithm","display_name":"BCJR algorithm","score":0.575063943862915},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.5503112077713013},{"id":"https://openalex.org/keywords/continuation","display_name":"Continuation","score":0.5311160087585449},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.513261079788208},{"id":"https://openalex.org/keywords/error-detection-and-correction","display_name":"Error detection and correction","score":0.4580099284648895},{"id":"https://openalex.org/keywords/coding-gain","display_name":"Coding gain","score":0.4496236741542816},{"id":"https://openalex.org/keywords/algorithm-design","display_name":"Algorithm design","score":0.4220849275588989},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.40434756875038147},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.3905121684074402},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2588816285133362},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.07420960068702698}],"concepts":[{"id":"https://openalex.org/C78065487","wikidata":"https://www.wikidata.org/wiki/Q1061598","display_name":"Reed\u2013Solomon error correction","level":5,"score":0.7266235947608948},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.725982666015625},{"id":"https://openalex.org/C132727834","wikidata":"https://www.wikidata.org/wiki/Q4892328","display_name":"Berlekamp\u2013Welch algorithm","level":5,"score":0.7136769890785217},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.6541496515274048},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6362248659133911},{"id":"https://openalex.org/C64948573","wikidata":"https://www.wikidata.org/wiki/Q625117","display_name":"BCJR algorithm","level":5,"score":0.575063943862915},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.5503112077713013},{"id":"https://openalex.org/C88626702","wikidata":"https://www.wikidata.org/wiki/Q1128903","display_name":"Continuation","level":2,"score":0.5311160087585449},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.513261079788208},{"id":"https://openalex.org/C103088060","wikidata":"https://www.wikidata.org/wiki/Q1062839","display_name":"Error detection and correction","level":2,"score":0.4580099284648895},{"id":"https://openalex.org/C76862118","wikidata":"https://www.wikidata.org/wiki/Q1105671","display_name":"Coding gain","level":3,"score":0.4496236741542816},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.4220849275588989},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.40434756875038147},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.3905121684074402},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2588816285133362},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.07420960068702698},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icc.2004.1312582","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icc.2004.1312582","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W635598304","https://openalex.org/W1530912015","https://openalex.org/W1593683169","https://openalex.org/W1594652978","https://openalex.org/W2013392609","https://openalex.org/W2016833807","https://openalex.org/W2018063252","https://openalex.org/W2032431003","https://openalex.org/W2146790060","https://openalex.org/W2168932491","https://openalex.org/W6644157379","https://openalex.org/W6653762932"],"related_works":["https://openalex.org/W1548705449","https://openalex.org/W2133789648","https://openalex.org/W2066795426","https://openalex.org/W2359973017","https://openalex.org/W2050784748","https://openalex.org/W2255105136","https://openalex.org/W2963132315","https://openalex.org/W2129263384","https://openalex.org/W3101821486","https://openalex.org/W2247418595"],"abstract_inverted_index":{"A":[0],"modification":[1],"of":[2,9,25,32,52,66],"Blahut":[3,47],"algorithm":[4,35,48,69],"is":[5,20,58,70],"proposed":[6,68],"for":[7,22,29,55,72],"decoding":[8],"Reed-Solomon":[10],"codes":[11],"beyond":[12],"half":[13],"the":[14,23,33,42,67],"minimum":[15],"distance.":[16],"An":[17,50],"effective":[18],"method":[19],"offered":[21],"searching":[24],"unknown":[26,56],"discrepancies":[27,57],"needed":[28],"analytical":[30],"continuation":[31],"Berlekamp-Massey":[34],"through":[36],"two":[37],"additional":[38],"iterations.":[39],"This":[40],"reduces":[41],"search":[43],"time":[44],"compared":[45],"to":[46],"considerably.":[49],"architecture":[51],"a":[53],"searcher":[54],"given.":[59],"The":[60],"coding":[61],"gain":[62],"and":[63],"implementation":[64],"complexity":[65],"shown":[71],"some":[73],"practical":[74],"codes.":[75]},"counts_by_year":[{"year":2018,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}