{"id":"https://openalex.org/W2160839632","doi":"https://doi.org/10.1109/isit.2004.1365295","title":"Iterative soft decision decoding of Reed Solomon codes based on adaptive parity check matrices","display_name":"Iterative soft decision decoding of Reed Solomon codes based on adaptive parity check matrices","publication_year":2004,"publication_date":"2004-12-23","ids":{"openalex":"https://openalex.org/W2160839632","doi":"https://doi.org/10.1109/isit.2004.1365295","mag":"2160839632"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2004.1365295","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2004.1365295","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","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/A5071271171","display_name":"Jing Jiang","orcid":"https://orcid.org/0000-0002-2646-8635"},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jing Jiang","raw_affiliation_strings":["EE Department, Texas A and M University, College Station, TX, USA","Dept. of Electr Eng., Texas A&M Univ., College Station, TX, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"EE Department, Texas A and M University, College Station, TX, USA","institution_ids":["https://openalex.org/I91045830"]},{"raw_affiliation_string":"Dept. of Electr Eng., Texas A&M Univ., College Station, TX, USA","institution_ids":["https://openalex.org/I91045830"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5010169197","display_name":"Krishna R. Narayanan","orcid":"https://orcid.org/0000-0001-8742-5332"},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"K.R. Narayanan","raw_affiliation_strings":["EE Department, Texas A and M University, College Station, TX, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"EE Department, Texas A and M University, College Station, TX, USA","institution_ids":["https://openalex.org/I91045830"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I91045830"],"apc_list":null,"apc_paid":null,"fwci":10.176,"has_fulltext":false,"cited_by_count":50,"citation_normalized_percentile":{"value":0.98103585,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"258","last_page":"258"},"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.9951000213623047,"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.9945999979972839,"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.8514765501022339},{"id":"https://openalex.org/keywords/parity-check-matrix","display_name":"Parity-check matrix","score":0.7875339984893799},{"id":"https://openalex.org/keywords/berlekamp\u2013welch-algorithm","display_name":"Berlekamp\u2013Welch algorithm","score":0.7700530290603638},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.7340843677520752},{"id":"https://openalex.org/keywords/sequential-decoding","display_name":"Sequential decoding","score":0.7095304131507874},{"id":"https://openalex.org/keywords/novelty","display_name":"Novelty","score":0.6252017021179199},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5380575060844421},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.49732282757759094},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.44873082637786865},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.427212119102478},{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.4168916940689087},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.33377736806869507},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.2933647334575653},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.21569228172302246}],"concepts":[{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.8514765501022339},{"id":"https://openalex.org/C95925971","wikidata":"https://www.wikidata.org/wiki/Q3100414","display_name":"Parity-check matrix","level":4,"score":0.7875339984893799},{"id":"https://openalex.org/C132727834","wikidata":"https://www.wikidata.org/wiki/Q4892328","display_name":"Berlekamp\u2013Welch algorithm","level":5,"score":0.7700530290603638},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.7340843677520752},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.7095304131507874},{"id":"https://openalex.org/C2778738651","wikidata":"https://www.wikidata.org/wiki/Q16546687","display_name":"Novelty","level":2,"score":0.6252017021179199},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5380575060844421},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.49732282757759094},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.44873082637786865},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.427212119102478},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.4168916940689087},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.33377736806869507},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.2933647334575653},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.21569228172302246},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C27206212","wikidata":"https://www.wikidata.org/wiki/Q34178","display_name":"Theology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2004.1365295","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2004.1365295","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","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":5,"referenced_works":["https://openalex.org/W2100852839","https://openalex.org/W2102864653","https://openalex.org/W2144727550","https://openalex.org/W2156826724","https://openalex.org/W2160839632"],"related_works":["https://openalex.org/W2100852839","https://openalex.org/W2128765501","https://openalex.org/W1606480398","https://openalex.org/W2023355697","https://openalex.org/W2156826724","https://openalex.org/W2138779125","https://openalex.org/W2115929510","https://openalex.org/W2032431003","https://openalex.org/W3102497619","https://openalex.org/W2135764410","https://openalex.org/W2077814477","https://openalex.org/W2133068391","https://openalex.org/W2035929826","https://openalex.org/W150917629","https://openalex.org/W2032697363","https://openalex.org/W2480341677","https://openalex.org/W1968416627","https://openalex.org/W2153697125","https://openalex.org/W2141398681","https://openalex.org/W2128068164"],"abstract_inverted_index":{"We":[0],"present":[1],"a":[2,36],"soft":[3,77],"decision":[4,68,78],"decoding":[5,22,42,69,79],"algorithm":[6,23],"for":[7],"Reed":[8],"Solomon":[9],"(RS)":[10],"codes":[11],"using":[12],"their":[13],"binary":[14],"image":[15],"representations.":[16],"The":[17],"novelty":[18],"of":[19],"the":[20,27,31,47,60],"proposed":[21],"is":[24],"in":[25,45],"reducing":[26],"submatrix":[28],"corresponding":[29],"to":[30,35,40,54],"less":[32],"reliable":[33],"bits":[34],"sparse":[37],"nature":[38],"prior":[39],"each":[41],"iteration":[43,53],"and":[44,71],"adapting":[46],"parity":[48],"check":[49],"matrix":[50],"from":[51],"one":[52],"another.":[55],"Simulation":[56],"results":[57],"show":[58],"that":[59],"new":[61],"method":[62],"provides":[63],"significant":[64],"gain":[65],"over":[66],"hard":[67],"(HDD)":[70],"compares":[72],"favorably":[73],"with":[74],"other":[75],"popular":[76],"methods":[80],"[R.":[81],"Koetter":[82],"et":[83],"al.,":[84],"2003].":[85]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2018,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-06-26T08:34:08.712188","created_date":"2025-10-10T00:00:00"}