{"doi":"10.1109/tcomm.2002.805279","title":"Soft decision decoding of Reed-Solomon codes","abstract":null,"journal":"IEEE Transactions on Communications","year":2002,"id":638894,"datarank":0.5775221402565088,"base_score":3.8501476017100584,"endowment":3.8501476017100584,"self_citation_contribution":0.5775221402565088,"citation_network_contribution":0.0,"self_endowment_contribution":0.5775221402565088,"citer_contribution":0.0,"corpus_percentile":null,"corpus_rank":null,"citation_count":46,"citer_count":0,"citers_with_citation_signal":0,"citers_with_endowment":0,"datacite_reuse_total":0,"is_dataset":false,"is_dataset_confidence":null,"is_data_producer":false,"deposit_databanks":null,"is_oa":false,"file_count":0,"downloads":0,"has_version_chain":false,"published_date":null,"fair_score":null,"fair_percentile":null,"algorithm_id":"datarank_citation_only_1hop_v6","ranking_scope":"data_only","authors":[{"id":1659700,"name":"B. Vucetic","orcid":null,"position":1,"is_corresponding":false},{"id":1659698,"name":"V. Ponnampalam","orcid":null,"position":0,"is_corresponding":false}],"reference_count":0,"raw_metadata":{"has_enrichment":true,"resolved":true,"title":"Soft decision decoding of Reed-Solomon codes","abstract":"This paper presents a maximum-likelihood decoding (MLD) and a suboptimum decoding algorithm for Reed-Solomon (RS) codes. The proposed algorithms are based on the algebraic structure of the binary images of RS codes. Theoretical bounds on the performance are derived and shown to be consistent with simulation results. The proposed suboptimum algorithm achieves near-MLD performance with significantly lower decoding complexity. It is also shown that the proposed suboptimum, algorithm has better performance compared with generalized minimum distance decoding, while the proposed MLD algorithm has significantly lower decoding complexity than the well-known Vardy-Be'ery (1991) MLD algorithm.","is_dataset_classified":null,"base_score":3.8501476017100584,"endowment":3.8501476017100584,"datacite_reuse_total":0,"file_count":0,"downloads":0,"views":0,"has_version_chain":false,"is_dataset":false,"is_oa":false,"pmid":"19767382","pmcid":null,"openalex_id":"https://openalex.org/W1976480044","authors":[],"funders":[],"total_grants":0,"fwci":6.7623,"citation_percentile":0.96929837,"influential_citations":0,"citation_trend":[{"year":2012,"count":4},{"year":2013,"count":2},{"year":2014,"count":1},{"year":2018,"count":1},{"year":2019,"count":2},{"year":2020,"count":1},{"year":2023,"count":2},{"year":2024,"count":2}],"oa_status":"closed","license":"https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html","oa_locations":[{"url":"http://xplorestaging.ieee.org/ielx5/26/24079/01097886.pdf?arnumber=1097886","host_type":"publisher"},{"url":"https://doi.org/10.1109/tcomm.2002.805279","host_type":"journal"}],"fields_of_study":["Coding theory and cryptography","graph theory and CDMA systems","Cryptographic Implementations and Security"],"mesh_terms":[],"keywords":["Decoding methods","Sequential decoding","Berlekamp–Welch algorithm","List decoding","Algorithm","Reed–Solomon error correction","Computer science","BCJR algorithm","Computational complexity theory","Concatenated error correction code","Mathematics","Block code"],"sdg_mappings":[{"sdg_number":0,"sdg_label":"Peace, Justice and strong institutions"}],"linked_datasets":[],"clinical_trials":[],"software_tools":[],"database_accessions":[],"source":"live","citation_network_status":"fetched"},"created_at":"2026-08-06T21:50:21.146212Z","pmid":null,"pmcid":null,"fwci":null,"citation_percentile":null,"influential_citations":0,"oa_status":null,"license":null,"views":0,"total_file_size_bytes":0,"version_count":0,"fair_f":null,"fair_a":null,"fair_i":null,"fair_r":null,"fair_zscore":null,"fair_rationale":null,"fair_model":null,"fair_agent_version":null,"fair_fulltext_source":null,"fair_has_llm":null,"fair_computed_at":null,"clinical_trials":[],"software_tools":[],"db_accessions":[],"linked_datasets":[],"topics":[]}