{"id":"https://openalex.org/W2744658369","doi":"https://doi.org/10.1109/isit.2017.8006546","title":"Iterative soft-decision decoding of reed-solomon codes of prime lengths","display_name":"Iterative soft-decision decoding of reed-solomon codes of prime lengths","publication_year":2017,"publication_date":"2017-06-01","ids":{"openalex":"https://openalex.org/W2744658369","doi":"https://doi.org/10.1109/isit.2017.8006546","mag":"2744658369"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2017.8006546","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2017.8006546","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":"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/A5100772114","display_name":"Shu Lin","orcid":"https://orcid.org/0000-0003-1401-7834"},"institutions":[{"id":"https://openalex.org/I84218800","display_name":"University of California, Davis","ror":"https://ror.org/05rrcem69","country_code":"US","type":"education","lineage":["https://openalex.org/I84218800"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Shu Lin","raw_affiliation_strings":["University of California, Davis, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California, Davis, CA, USA","institution_ids":["https://openalex.org/I84218800"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5102938606","display_name":"Khaled Abdel-Ghaffar","orcid":"https://orcid.org/0000-0002-3128-0557"},"institutions":[{"id":"https://openalex.org/I84218800","display_name":"University of California, Davis","ror":"https://ror.org/05rrcem69","country_code":"US","type":"education","lineage":["https://openalex.org/I84218800"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Khaled Abdel-Ghaffar","raw_affiliation_strings":["University of California, Davis, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California, Davis, CA, USA","institution_ids":["https://openalex.org/I84218800"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5038106711","display_name":"Juane Li","orcid":"https://orcid.org/0000-0003-1004-3453"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Juane Li","raw_affiliation_strings":["AppoTech USA, Sunnyvale, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"AppoTech USA, Sunnyvale, CA, USA","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101690383","display_name":"Keke Liu","orcid":"https://orcid.org/0000-0003-3969-8808"},"institutions":[{"id":"https://openalex.org/I4210127325","display_name":"Broadcom (United States)","ror":"https://ror.org/035gt5s03","country_code":"US","type":"company","lineage":["https://openalex.org/I4210127325"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Keke Liu","raw_affiliation_strings":["Broadcom, San Jose, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Broadcom, San Jose, CA, USA","institution_ids":["https://openalex.org/I4210127325"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.8305,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.78007652,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"341","last_page":"345"},"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.9959999918937683,"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.9952999949455261,"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/parity-check-matrix","display_name":"Parity-check matrix","score":0.7778700590133667},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.7740452885627747},{"id":"https://openalex.org/keywords/berlekamp\u2013welch-algorithm","display_name":"Berlekamp\u2013Welch algorithm","score":0.6951167583465576},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.6897406578063965},{"id":"https://openalex.org/keywords/sequential-decoding","display_name":"Sequential decoding","score":0.6813933253288269},{"id":"https://openalex.org/keywords/reed\u2013solomon-error-correction","display_name":"Reed\u2013Solomon error correction","score":0.6316579580307007},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5268394351005554},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5066081285476685},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.5007460117340088},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.4777633249759674},{"id":"https://openalex.org/keywords/code-word","display_name":"Code word","score":0.46526503562927246},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.41488727927207947},{"id":"https://openalex.org/keywords/serial-concatenated-convolutional-codes","display_name":"Serial concatenated convolutional codes","score":0.41461390256881714},{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.41204628348350525},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.38203608989715576},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.34589651226997375},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.2882091999053955}],"concepts":[{"id":"https://openalex.org/C95925971","wikidata":"https://www.wikidata.org/wiki/Q3100414","display_name":"Parity-check matrix","level":4,"score":0.7778700590133667},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.7740452885627747},{"id":"https://openalex.org/C132727834","wikidata":"https://www.wikidata.org/wiki/Q4892328","display_name":"Berlekamp\u2013Welch algorithm","level":5,"score":0.6951167583465576},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.6897406578063965},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.6813933253288269},{"id":"https://openalex.org/C78065487","wikidata":"https://www.wikidata.org/wiki/Q1061598","display_name":"Reed\u2013Solomon error correction","level":5,"score":0.6316579580307007},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5268394351005554},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5066081285476685},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.5007460117340088},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.4777633249759674},{"id":"https://openalex.org/C153207627","wikidata":"https://www.wikidata.org/wiki/Q863873","display_name":"Code word","level":3,"score":0.46526503562927246},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.41488727927207947},{"id":"https://openalex.org/C33529081","wikidata":"https://www.wikidata.org/wiki/Q18378194","display_name":"Serial concatenated convolutional codes","level":5,"score":0.41461390256881714},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.41204628348350525},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.38203608989715576},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.34589651226997375},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.2882091999053955}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2017.8006546","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2017.8006546","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":[{"score":0.800000011920929,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1593683169","https://openalex.org/W1969813053","https://openalex.org/W2013562877","https://openalex.org/W2023355697","https://openalex.org/W2067501233","https://openalex.org/W2077814477","https://openalex.org/W2100852839","https://openalex.org/W2115044769","https://openalex.org/W2117422096","https://openalex.org/W2138779125","https://openalex.org/W3102497619","https://openalex.org/W4239889878","https://openalex.org/W4256264271"],"related_works":["https://openalex.org/W2121408388","https://openalex.org/W2378000016","https://openalex.org/W2361015587","https://openalex.org/W2952710341","https://openalex.org/W1975709480","https://openalex.org/W2066795426","https://openalex.org/W2083005904","https://openalex.org/W2508865029","https://openalex.org/W90969106","https://openalex.org/W2141398681"],"abstract_inverted_index":{"A":[0],"novel":[1],"scheme":[2,85],"is":[3,16,54],"presented":[4],"for":[5,43],"encoding":[6],"and":[7],"decoding":[8,52,84,91],"of":[9,12,21,61],"Reed-Solomon":[10,65,93],"codes":[11],"prime":[13],"lengths.":[14],"Encoding":[15],"performed":[17],"on":[18],"a":[19,31,34,39,48,59],"collection":[20,60],"codewords":[22,62,94],"which":[23],"are":[24],"mapped":[25],"through":[26],"Galois":[27],"Fourier":[28],"transform":[29],"into":[30],"codeword":[32],"in":[33,63,79],"low-density":[35],"parity-check":[36,41],"code":[37],"with":[38],"binary":[40,49],"matrix":[42],"transmission.":[44],"Using":[45],"this":[46],"matrix,":[47],"iterative":[50],"soft-decision":[51],"algorithm":[53],"applied":[55],"to":[56,76],"jointly":[57],"decode":[58],"the":[64,72,77,80,82],"code.":[66],"By":[67],"allowing":[68],"information":[69],"sharing":[70],"among":[71],"received":[73],"vectors":[74],"corresponding":[75],"code-words":[78],"collection,":[81],"proposed":[83],"achieves":[86],"superior":[87],"performance":[88],"over":[89],"algorithms":[90],"individual":[92],"including":[95],"maximum":[96],"likelihood":[97],"decoding.":[98]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}