{"id":"https://openalex.org/W1602156423","doi":"https://doi.org/10.1109/icc.2003.1204567","title":"Soft-decision decoding of Reed-Solomon codes on magnetic recording channels with erasures","display_name":"Soft-decision decoding of Reed-Solomon codes on magnetic recording channels with erasures","publication_year":2004,"publication_date":"2004-03-02","ids":{"openalex":"https://openalex.org/W1602156423","doi":"https://doi.org/10.1109/icc.2003.1204567","mag":"1602156423"},"language":"en","primary_location":{"id":"doi:10.1109/icc.2003.1204567","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icc.2003.1204567","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE International Conference on Communications, 2003. ICC '03.","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/A5113676723","display_name":"Haitao Xia","orcid":null},"institutions":[{"id":"https://openalex.org/I8692664","display_name":"University of Oklahoma","ror":"https://ror.org/02aqsxs83","country_code":"US","type":"education","lineage":["https://openalex.org/I8692664"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Haitao Xia","raw_affiliation_strings":["School of Electrical and Computer Engineering, University of Oklahama, Norman, OK, USA","[Sch. of Electr. & Comput. Eng., Oklahoma Univ., Norman, OK, USA]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Electrical and Computer Engineering, University of Oklahama, Norman, OK, USA","institution_ids":["https://openalex.org/I8692664"]},{"raw_affiliation_string":"[Sch. of Electr. & Comput. Eng., Oklahoma Univ., Norman, OK, USA]","institution_ids":["https://openalex.org/I8692664"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5102738014","display_name":"J.R. Cruz","orcid":"https://orcid.org/0000-0002-7022-6705"},"institutions":[{"id":"https://openalex.org/I8692664","display_name":"University of Oklahoma","ror":"https://ror.org/02aqsxs83","country_code":"US","type":"education","lineage":["https://openalex.org/I8692664"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"J.R. Cruz","raw_affiliation_strings":["School of Electrical and Computer Engineering, University of Oklahama, Norman, OK, USA","[Sch. of Electr. & Comput. Eng., Oklahoma Univ., Norman, OK, USA]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Electrical and Computer Engineering, University of Oklahama, Norman, OK, USA","institution_ids":["https://openalex.org/I8692664"]},{"raw_affiliation_string":"[Sch. of Electr. & Comput. Eng., Oklahoma Univ., Norman, OK, USA]","institution_ids":["https://openalex.org/I8692664"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I8692664"],"apc_list":null,"apc_paid":null,"fwci":0.6615,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.6564549,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"4","issue":null,"first_page":"2909","last_page":"2913"},"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.9987999796867371,"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/T12162","display_name":"Cellular Automata and Applications","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/list-decoding","display_name":"List decoding","score":0.6578284502029419},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.6548177599906921},{"id":"https://openalex.org/keywords/reed\u2013solomon-error-correction","display_name":"Reed\u2013Solomon error correction","score":0.646233081817627},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6132568717002869},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5790020227432251},{"id":"https://openalex.org/keywords/additive-white-gaussian-noise","display_name":"Additive white Gaussian noise","score":0.5174154043197632},{"id":"https://openalex.org/keywords/sequential-decoding","display_name":"Sequential decoding","score":0.510913074016571},{"id":"https://openalex.org/keywords/bcjr-algorithm","display_name":"BCJR algorithm","score":0.4413388669490814},{"id":"https://openalex.org/keywords/berlekamp\u2013welch-algorithm","display_name":"Berlekamp\u2013Welch algorithm","score":0.4337741732597351},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.40493229031562805},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.35596224665641785},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.3516055941581726},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.322552889585495},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.2888184189796448},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.11539760231971741}],"concepts":[{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.6578284502029419},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.6548177599906921},{"id":"https://openalex.org/C78065487","wikidata":"https://www.wikidata.org/wiki/Q1061598","display_name":"Reed\u2013Solomon error correction","level":5,"score":0.646233081817627},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6132568717002869},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5790020227432251},{"id":"https://openalex.org/C169334058","wikidata":"https://www.wikidata.org/wiki/Q353292","display_name":"Additive white Gaussian noise","level":3,"score":0.5174154043197632},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.510913074016571},{"id":"https://openalex.org/C64948573","wikidata":"https://www.wikidata.org/wiki/Q625117","display_name":"BCJR algorithm","level":5,"score":0.4413388669490814},{"id":"https://openalex.org/C132727834","wikidata":"https://www.wikidata.org/wiki/Q4892328","display_name":"Berlekamp\u2013Welch algorithm","level":5,"score":0.4337741732597351},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.40493229031562805},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.35596224665641785},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.3516055941581726},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.322552889585495},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.2888184189796448},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.11539760231971741}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icc.2003.1204567","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icc.2003.1204567","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE International Conference on Communications, 2003. ICC '03.","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16","score":0.7900000214576721}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W42469326","https://openalex.org/W2032431003","https://openalex.org/W2100852839","https://openalex.org/W2113809334","https://openalex.org/W2122346635","https://openalex.org/W2124414306","https://openalex.org/W2128765501","https://openalex.org/W2129426708","https://openalex.org/W4234370216","https://openalex.org/W6601745702","https://openalex.org/W6675264462"],"related_works":["https://openalex.org/W1548705449","https://openalex.org/W2050784748","https://openalex.org/W2359973017","https://openalex.org/W2255105136","https://openalex.org/W2247418595","https://openalex.org/W1980817751","https://openalex.org/W2383267581","https://openalex.org/W1646172719","https://openalex.org/W2377186915","https://openalex.org/W1866038923"],"abstract_inverted_index":{"A":[0],"soft-decision":[1,91,99],"Reed-Solomon":[2],"decoding":[3,74],"algorithm":[4,26,82,100],"has":[5],"been":[6,58],"recently":[7],"proposed":[8],"by":[9,18],"Koetter":[10],"and":[11,37,40,51,70,93],"Vardy,":[12],"which":[13],"provides":[14],"significant":[15],"coding":[16,55],"gains":[17,56],"fully":[19],"utilizing":[20],"channel":[21],"output":[22],"reliability":[23,29],"information.":[24],"The":[25],"converts":[27],"this":[28],"information":[30],"into":[31],"a":[32,79],"set":[33],"of":[34,42,97,108],"interpolation":[35],"points":[36],"their":[38],"multiplicities,":[39],"consists":[41],"three":[43],"day":[44],"steps:":[45],"multiplicity":[46,86],"matrix":[47],"calculation,":[48],"soft":[49],"interpolation,":[50],"polynomial":[52],"factorization.":[53],"Large":[54],"have":[57],"observed":[59],"only":[60],"for":[61,83,90],"low-rate":[62],"codes":[63],"in":[64,105],"additive":[65],"white":[66],"Gaussian":[67],"noise":[68],"channels,":[69],"with":[71],"very":[72],"high":[73],"complexity.":[75],"Here":[76],"we":[77],"present":[78],"new":[80],"suboptimal":[81],"computing":[84],"the":[85,95,98,106],"matrix,":[87],"discuss":[88],"architectures":[89],"decoders":[92],"evaluate":[94],"performance":[96],"on":[101],"magnetic":[102],"recording":[103],"channels":[104],"presence":[107],"erasures.":[109]},"counts_by_year":[{"year":2018,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}