{"id":"https://openalex.org/W2911476871","doi":"https://doi.org/10.1109/istc.2018.8625323","title":"Collective Encoding and Iterative Soft-Decision Decoding of Cyclic Codes of Prime Lengths in Galois-Fourier Transform Domain","display_name":"Collective Encoding and Iterative Soft-Decision Decoding of Cyclic Codes of Prime Lengths in Galois-Fourier Transform Domain","publication_year":2018,"publication_date":"2018-12-01","ids":{"openalex":"https://openalex.org/W2911476871","doi":"https://doi.org/10.1109/istc.2018.8625323","mag":"2911476871"},"language":"en","primary_location":{"id":"doi:10.1109/istc.2018.8625323","is_oa":false,"landing_page_url":"https://doi.org/10.1109/istc.2018.8625323","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE 10th International Symposium on Turbo Codes & Iterative Information Processing (ISTC)","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/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":true,"raw_author_name":"Shu Lin","raw_affiliation_strings":["University of California, Davis, Davis, CA, USA"],"affiliations":[{"raw_affiliation_string":"University of California, Davis, 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, Davis, CA, USA"],"affiliations":[{"raw_affiliation_string":"University of California, Davis, 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":[{"id":"https://openalex.org/I11912373","display_name":"Micron (United States)","ror":"https://ror.org/02fv52296","country_code":"US","type":"company","lineage":["https://openalex.org/I11912373"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Juane Li","raw_affiliation_strings":["Micron Technology Inc., Milpitas, CA, USA"],"affiliations":[{"raw_affiliation_string":"Micron Technology Inc., Milpitas, CA, USA","institution_ids":["https://openalex.org/I11912373"]}]},{"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 Inc., San Jose, CA, USA"],"affiliations":[{"raw_affiliation_string":"Broadcom Inc., San Jose, CA, USA","institution_ids":["https://openalex.org/I4210127325"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5100772114"],"corresponding_institution_ids":["https://openalex.org/I84218800"],"apc_list":null,"apc_paid":null,"fwci":0.3691,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.66678655,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"8"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9998999834060669,"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/T11130","display_name":"Coding theory and cryptography","score":0.9997000098228455,"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/T12162","display_name":"Cellular Automata and Applications","score":0.9993000030517578,"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.7367266416549683},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.7053717374801636},{"id":"https://openalex.org/keywords/sequential-decoding","display_name":"Sequential decoding","score":0.6944641470909119},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6070850491523743},{"id":"https://openalex.org/keywords/berlekamp\u2013welch-algorithm","display_name":"Berlekamp\u2013Welch algorithm","score":0.5586186051368713},{"id":"https://openalex.org/keywords/parity-check-matrix","display_name":"Parity-check matrix","score":0.49609383940696716},{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.48209765553474426},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.4721149206161499},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.46953001618385315},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4360900819301605},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.39586812257766724},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.2691255807876587}],"concepts":[{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.7367266416549683},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.7053717374801636},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.6944641470909119},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6070850491523743},{"id":"https://openalex.org/C132727834","wikidata":"https://www.wikidata.org/wiki/Q4892328","display_name":"Berlekamp\u2013Welch algorithm","level":5,"score":0.5586186051368713},{"id":"https://openalex.org/C95925971","wikidata":"https://www.wikidata.org/wiki/Q3100414","display_name":"Parity-check matrix","level":4,"score":0.49609383940696716},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.48209765553474426},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.4721149206161499},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.46953001618385315},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4360900819301605},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.39586812257766724},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.2691255807876587}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/istc.2018.8625323","is_oa":false,"landing_page_url":"https://doi.org/10.1109/istc.2018.8625323","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE 10th International Symposium on Turbo Codes & Iterative Information Processing (ISTC)","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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W391578156","https://openalex.org/W628021441","https://openalex.org/W1534925464","https://openalex.org/W1589190557","https://openalex.org/W1593683169","https://openalex.org/W1594652978","https://openalex.org/W1969813053","https://openalex.org/W2013562877","https://openalex.org/W2050687505","https://openalex.org/W2067501233","https://openalex.org/W2123530431","https://openalex.org/W2127342417","https://openalex.org/W2168353136","https://openalex.org/W2182112064","https://openalex.org/W2610857016","https://openalex.org/W2967758399","https://openalex.org/W3194602862","https://openalex.org/W4239889878","https://openalex.org/W4256264271"],"related_works":["https://openalex.org/W2028976748","https://openalex.org/W2085052822","https://openalex.org/W2118148379","https://openalex.org/W2154603729","https://openalex.org/W4210406383","https://openalex.org/W2160839632","https://openalex.org/W4303471944","https://openalex.org/W2110262961","https://openalex.org/W2744658369","https://openalex.org/W2127999627"],"abstract_inverted_index":{"This":[0,104],"paper":[1],"presents":[2],"a":[3,29,35,49,56,73,111],"novel":[4],"coding":[5],"scheme":[6],"for":[7,60],"collective":[8,11],"encoding":[9,27],"and":[10,46,106,130],"iterative":[12,66,101,124],"soft-decision":[13],"decoding":[14,67,102,118,125,133],"of":[15,18,28,37,75,119],"cyclic":[16,30,79],"codes":[17],"prime":[19],"lengths":[20],"in":[21,51,77,96],"Galois-Fourier":[22],"transform":[23],"(GFT)":[24],"domain.":[25],"The":[26,81,122],"code":[31,54],"is":[32,68],"performed":[33,128],"on":[34],"collection":[36,74,98],"codewords":[38,76,95],"which":[39],"are":[40],"mapped":[41],"through":[42],"composition,":[43],"Hadamard":[44],"permutations,":[45],"GFT":[47],"into":[48],"codeword":[50],"an":[52],"LDPC":[53],"with":[55],"binary":[57,65,123],"parity-check":[58],"matrix":[59],"transmission.":[61],"Using":[62],"this":[63],"matrix,":[64],"applied":[69],"to":[70,92],"jointly":[71],"decode":[72],"the":[78,88,93,97,100,115,132],"code.":[80],"joint-decoding":[82,105,112],"allows":[83],"reliability":[84],"information":[85,107],"sharing":[86,108],"among":[87],"received":[89],"vectors":[90],"corresponding":[91],"transmitted":[94],"during":[99],"process.":[103],"can":[109,126],"achieve":[110],"gain":[113],"over":[114],"maximum":[116],"likelihood":[117],"individual":[120],"codewords.":[121],"be":[127],"efficiently":[129],"reduces":[131],"complexity":[134],"significantly.":[135]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2021,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}