{"id":"https://openalex.org/W2159333237","doi":"https://doi.org/10.1109/icc.2009.5198625","title":"A Low Complexity Iterative Technique for Soft Decision Decoding of Reed-Solomon Codes","display_name":"A Low Complexity Iterative Technique for Soft Decision Decoding of Reed-Solomon Codes","publication_year":2009,"publication_date":"2009-06-01","ids":{"openalex":"https://openalex.org/W2159333237","doi":"https://doi.org/10.1109/icc.2009.5198625","mag":"2159333237"},"language":"en","primary_location":{"id":"doi:10.1109/icc.2009.5198625","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icc.2009.5198625","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE International Conference on Communications","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/A5050302330","display_name":"Farnaz Shayegh","orcid":null},"institutions":[{"id":"https://openalex.org/I60158472","display_name":"Concordia University","ror":"https://ror.org/0420zvk78","country_code":"CA","type":"education","lineage":["https://openalex.org/I60158472"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"F. Shayegh","raw_affiliation_strings":["Electrical and Computer Engineering Department, Concordia University, Montreal, QUE, Canada"],"affiliations":[{"raw_affiliation_string":"Electrical and Computer Engineering Department, Concordia University, Montreal, QUE, Canada","institution_ids":["https://openalex.org/I60158472"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103172344","display_name":"M. Reza Soleymani","orcid":"https://orcid.org/0000-0002-4913-833X"},"institutions":[{"id":"https://openalex.org/I60158472","display_name":"Concordia University","ror":"https://ror.org/0420zvk78","country_code":"CA","type":"education","lineage":["https://openalex.org/I60158472"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"M. R. Soleymani","raw_affiliation_strings":["Electrical and Computer Engineering Department, Concordia University, Montreal, QUE, Canada"],"affiliations":[{"raw_affiliation_string":"Electrical and Computer Engineering Department, Concordia University, Montreal, QUE, Canada","institution_ids":["https://openalex.org/I60158472"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5050302330"],"corresponding_institution_ids":["https://openalex.org/I60158472"],"apc_list":null,"apc_paid":null,"fwci":1.3085,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.85292463,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"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.9968000054359436,"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.9954000115394592,"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.8195177316665649},{"id":"https://openalex.org/keywords/belief-propagation","display_name":"Belief propagation","score":0.7901929616928101},{"id":"https://openalex.org/keywords/berlekamp\u2013welch-algorithm","display_name":"Berlekamp\u2013Welch algorithm","score":0.7045859098434448},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.6785227060317993},{"id":"https://openalex.org/keywords/sequential-decoding","display_name":"Sequential decoding","score":0.6721346378326416},{"id":"https://openalex.org/keywords/parity-check-matrix","display_name":"Parity-check matrix","score":0.645224928855896},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5715363621711731},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5608547329902649},{"id":"https://openalex.org/keywords/factor-graph","display_name":"Factor graph","score":0.5373474955558777},{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.5150699019432068},{"id":"https://openalex.org/keywords/tanner-graph","display_name":"Tanner graph","score":0.501960039138794},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.4742487967014313},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.4719250202178955},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.43519604206085205},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.42409610748291016},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.41813716292381287},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3677774965763092},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.32882070541381836}],"concepts":[{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.8195177316665649},{"id":"https://openalex.org/C152948882","wikidata":"https://www.wikidata.org/wiki/Q4060686","display_name":"Belief propagation","level":3,"score":0.7901929616928101},{"id":"https://openalex.org/C132727834","wikidata":"https://www.wikidata.org/wiki/Q4892328","display_name":"Berlekamp\u2013Welch algorithm","level":5,"score":0.7045859098434448},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.6785227060317993},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.6721346378326416},{"id":"https://openalex.org/C95925971","wikidata":"https://www.wikidata.org/wiki/Q3100414","display_name":"Parity-check matrix","level":4,"score":0.645224928855896},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5715363621711731},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5608547329902649},{"id":"https://openalex.org/C159246509","wikidata":"https://www.wikidata.org/wiki/Q5428725","display_name":"Factor graph","level":3,"score":0.5373474955558777},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.5150699019432068},{"id":"https://openalex.org/C87117866","wikidata":"https://www.wikidata.org/wiki/Q7683664","display_name":"Tanner graph","level":5,"score":0.501960039138794},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.4742487967014313},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.4719250202178955},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.43519604206085205},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.42409610748291016},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.41813716292381287},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3677774965763092},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.32882070541381836}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icc.2009.5198625","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icc.2009.5198625","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE International Conference on Communications","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.8100000023841858,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W391578156","https://openalex.org/W1536930200","https://openalex.org/W2077814477","https://openalex.org/W2100852839","https://openalex.org/W2102864653","https://openalex.org/W2103236224","https://openalex.org/W2117422096","https://openalex.org/W2128765501","https://openalex.org/W2144727550","https://openalex.org/W2461009244","https://openalex.org/W2610857016","https://openalex.org/W2942537621","https://openalex.org/W3102497619"],"related_works":["https://openalex.org/W26187695","https://openalex.org/W2153118538","https://openalex.org/W1493544699","https://openalex.org/W2127562763","https://openalex.org/W1978153242","https://openalex.org/W2118148379","https://openalex.org/W2106520586","https://openalex.org/W2591644370","https://openalex.org/W2067707844","https://openalex.org/W2159333237"],"abstract_inverted_index":{"A":[0],"new":[1],"iterative":[2],"soft":[3,147],"decision":[4,137,148],"decoding":[5,29,149],"method":[6,14,125],"for":[7,31],"Reed-Solomon":[8],"(RS)":[9],"codes":[10,133],"is":[11,15,141],"proposed.":[12],"This":[13],"based":[16],"on":[17,77,87],"bit":[18],"level":[19],"belief":[20,84],"propagation":[21,85],"(BP)":[22],"decoding.":[23,138],"In":[24,62],"order":[25],"to":[26,52,135,144],"make":[27],"BP":[28],"effective":[30],"RS":[32,74,132],"codes,":[33],"we":[34,66,80],"use":[35],"an":[36],"extended":[37],"binary":[38,55,99],"parity":[39,56,100],"check":[40,57,101],"matrix":[41,58],"with":[42,96],"a":[43],"lower":[44],"density":[45],"and":[46,118],"reduced":[47],"number":[48],"of":[49,59,69,73,92,107,112,131],"4-cycles":[50],"compared":[51,134],"the":[53,60,70,83,93,97,110,113],"original":[54],"code.":[61],"our":[63],"proposed":[64],"method,":[65],"take":[67],"advantage":[68],"cyclic":[71],"structure":[72],"codes.":[75],"Based":[76],"this":[78],"property,":[79],"can":[81,121],"apply":[82],"algorithm":[86],"any":[88],"cyclically":[89],"shifted":[90,105],"version":[91,106],"received":[94,108],"symbols":[95],"same":[98],"matrix.":[102],"For":[103],"each":[104],"symbols,":[109],"geometry":[111],"factor":[114],"graph":[115],"will":[116],"change":[117],"deterministic":[119],"errors":[120],"be":[122],"avoided.":[123],"Our":[124],"results":[126],"in":[127],"considerable":[128],"performance":[129,140],"improvement":[130],"hard":[136],"The":[139],"also":[142],"superior":[143],"some":[145],"popular":[146],"methods.":[150]},"counts_by_year":[{"year":2020,"cited_by_count":2},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}