{"id":"https://openalex.org/W2742523012","doi":"https://doi.org/10.1109/isit.2017.8007035","title":"An iterative soft-decision decoding algorithm for Reed-Solomon codes","display_name":"An iterative soft-decision decoding algorithm for Reed-Solomon codes","publication_year":2017,"publication_date":"2017-06-01","ids":{"openalex":"https://openalex.org/W2742523012","doi":"https://doi.org/10.1109/isit.2017.8007035","mag":"2742523012"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2017.8007035","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2017.8007035","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 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/A5041597479","display_name":"Huang\u2013Chang Lee","orcid":"https://orcid.org/0000-0002-1165-9383"},"institutions":[{"id":"https://openalex.org/I3020100970","display_name":"Chang Gung Memorial Hospital","ror":"https://ror.org/02verss31","country_code":"TW","type":"healthcare","lineage":["https://openalex.org/I3020100970"]}],"countries":["TW"],"is_corresponding":true,"raw_author_name":"Huang-Chang Lee","raw_affiliation_strings":["Dept. of Electrical Engineering, Chang Gung University, Taoyuan City, Taiwan R.O.C","Dept. of Neurological Surgery of Chang Gung Memorial Hospital, Taoyuan, Taiwan"],"affiliations":[{"raw_affiliation_string":"Dept. of Electrical Engineering, Chang Gung University, Taoyuan City, Taiwan R.O.C","institution_ids":[]},{"raw_affiliation_string":"Dept. of Neurological Surgery of Chang Gung Memorial Hospital, Taoyuan, Taiwan","institution_ids":["https://openalex.org/I3020100970"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5068204739","display_name":"Jyun-Han Wu","orcid":null},"institutions":[{"id":"https://openalex.org/I25846049","display_name":"National Tsing Hua University","ror":"https://ror.org/00zdnkx70","country_code":"TW","type":"education","lineage":["https://openalex.org/I25846049"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Jyun-Han Wu","raw_affiliation_strings":["Dept. of Electrical Engineering, National Tsing Hua University, Hsinchu, Taiwan R.O.C"],"affiliations":[{"raw_affiliation_string":"Dept. of Electrical Engineering, National Tsing Hua University, Hsinchu, Taiwan R.O.C","institution_ids":["https://openalex.org/I25846049"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5026192663","display_name":"Chung-Hsuan Wang","orcid":"https://orcid.org/0000-0002-5076-918X"},"institutions":[{"id":"https://openalex.org/I148366613","display_name":"National Yang Ming Chiao Tung University","ror":"https://ror.org/00se2k293","country_code":"TW","type":"education","lineage":["https://openalex.org/I148366613"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Chung-Hsuan Wang","raw_affiliation_strings":["Dept. of Electrical and Computer Engineering, National Chiao Tung University, Hsinchu, Taiwan, R.O.C"],"affiliations":[{"raw_affiliation_string":"Dept. of Electrical and Computer Engineering, National Chiao Tung University, Hsinchu, Taiwan, R.O.C","institution_ids":["https://openalex.org/I148366613"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5048130890","display_name":"Yeong-Luh Ueng","orcid":"https://orcid.org/0000-0002-3438-0385"},"institutions":[{"id":"https://openalex.org/I25846049","display_name":"National Tsing Hua University","ror":"https://ror.org/00zdnkx70","country_code":"TW","type":"education","lineage":["https://openalex.org/I25846049"]},{"id":"https://openalex.org/I148366613","display_name":"National Yang Ming Chiao Tung University","ror":"https://ror.org/00se2k293","country_code":"TW","type":"education","lineage":["https://openalex.org/I148366613"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Yeong-Luh Ueng","raw_affiliation_strings":["Dept. of Electrical Engineering, National Tsing Hua University, Hsinchu, Taiwan R.O.C","Institute of Communications Engineering, National Chiao Tung University, Hsinchu, Taiwan, R.O.C"],"affiliations":[{"raw_affiliation_string":"Dept. of Electrical Engineering, National Tsing Hua University, Hsinchu, Taiwan R.O.C","institution_ids":["https://openalex.org/I25846049"]},{"raw_affiliation_string":"Institute of Communications Engineering, National Chiao Tung University, Hsinchu, Taiwan, R.O.C","institution_ids":["https://openalex.org/I148366613"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5041597479"],"corresponding_institution_ids":["https://openalex.org/I3020100970"],"apc_list":null,"apc_paid":null,"fwci":0.9751,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.82031866,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"52","issue":null,"first_page":"2775","last_page":"2779"},"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/T11321","display_name":"Error Correcting Code Techniques","score":0.996999979019165,"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"}},{"id":"https://openalex.org/T10951","display_name":"Cryptographic Implementations and Security","score":0.9908000230789185,"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/decoding-methods","display_name":"Decoding methods","score":0.8496116995811462},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.7640254497528076},{"id":"https://openalex.org/keywords/berlekamp\u2013welch-algorithm","display_name":"Berlekamp\u2013Welch algorithm","score":0.7277644276618958},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6755608320236206},{"id":"https://openalex.org/keywords/parity-check-matrix","display_name":"Parity-check matrix","score":0.6571090221405029},{"id":"https://openalex.org/keywords/sequential-decoding","display_name":"Sequential decoding","score":0.6179981231689453},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6122514605522156},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5514289140701294},{"id":"https://openalex.org/keywords/reed\u2013solomon-error-correction","display_name":"Reed\u2013Solomon error correction","score":0.5182980895042419},{"id":"https://openalex.org/keywords/error-detection-and-correction","display_name":"Error detection and correction","score":0.4211937487125397},{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.3899906873703003},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.3824799656867981},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.2659832239151001},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.24676409363746643},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.10971757769584656}],"concepts":[{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.8496116995811462},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.7640254497528076},{"id":"https://openalex.org/C132727834","wikidata":"https://www.wikidata.org/wiki/Q4892328","display_name":"Berlekamp\u2013Welch algorithm","level":5,"score":0.7277644276618958},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6755608320236206},{"id":"https://openalex.org/C95925971","wikidata":"https://www.wikidata.org/wiki/Q3100414","display_name":"Parity-check matrix","level":4,"score":0.6571090221405029},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.6179981231689453},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6122514605522156},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5514289140701294},{"id":"https://openalex.org/C78065487","wikidata":"https://www.wikidata.org/wiki/Q1061598","display_name":"Reed\u2013Solomon error correction","level":5,"score":0.5182980895042419},{"id":"https://openalex.org/C103088060","wikidata":"https://www.wikidata.org/wiki/Q1062839","display_name":"Error detection and correction","level":2,"score":0.4211937487125397},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.3899906873703003},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.3824799656867981},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.2659832239151001},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24676409363746643},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.10971757769584656}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2017.8007035","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2017.8007035","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","score":0.8100000023841858,"display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1967281166","https://openalex.org/W2057153875","https://openalex.org/W2077814477","https://openalex.org/W2115044769","https://openalex.org/W2122493145","https://openalex.org/W2132538409","https://openalex.org/W2134502194","https://openalex.org/W2162078055","https://openalex.org/W2546806290","https://openalex.org/W4234843542","https://openalex.org/W6669792194"],"related_works":["https://openalex.org/W2247418595","https://openalex.org/W2028976748","https://openalex.org/W1548705449","https://openalex.org/W2050784748","https://openalex.org/W2359973017","https://openalex.org/W2085052822","https://openalex.org/W2255105136","https://openalex.org/W2118148379","https://openalex.org/W4210406383","https://openalex.org/W2160839632"],"abstract_inverted_index":{"This":[0],"paper":[1],"proposes":[2],"an":[3],"iterative":[4],"soft-decision":[5,132],"decoding":[6,14,62,89,133],"algorithm":[7,15],"for":[8,134],"Reed-Solomon":[9],"(RS)":[10],"codes.":[11,136],"The":[12,29],"proposed":[13,87],"combines":[16],"the":[17,21,38,44,53,59,73,76,86,97,107,129],"concepts":[18],"of":[19,75,120],"adapting":[20],"parity-check":[22,30],"matrix":[23,31],"and":[24,106,117],"informed":[25],"dynamic":[26,57],"scheduling":[27],"decoding.":[28],"is":[32,41,90,124],"re-arranged":[33],"before":[34],"each":[35],"iteration,":[36],"where":[37],"systematic":[39],"part":[40],"mapped":[42],"to":[43,66,92,114,127],"least":[45,68],"reliable":[46,69],"bits,":[47,70],"consequently":[48],"reducing":[49],"their":[50],"influence":[51],"on":[52],"other":[54],"bits.":[55],"Using":[56],"scheduling,":[58],"more":[60],"important":[61],"messages":[63],"are":[64],"updated":[65],"these":[67],"meaning":[71],"that":[72],"majority":[74],"error":[77,102],"bits":[78],"with":[79],"low":[80],"reliability":[81],"can":[82,111],"be":[83,112],"corrected.":[84],"When":[85],"integrated":[88],"applied":[91],"(255,":[93],"239)":[94],"RS":[95,135],"code,":[96],"difference":[98],"between":[99],"its":[100],"frame":[101],"rate":[103],"performance":[104],"(FER)":[105],"maximum-likelihood":[108],"(ML)":[109],"bound":[110],"reduced":[113],"0.8":[115],"dB,":[116],"a":[118],"gain":[119],"about":[121],"0.1":[122],"dB":[123],"achieved":[125],"compared":[126],"all":[128],"previously":[130],"recorded":[131]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}