{"id":"https://openalex.org/W2167388241","doi":"https://doi.org/10.1109/wimob.2006.1696346","title":"Fast and Reduced-Complexity Decoding Rule for qary LDPC Codes by Using the Duality Properties","display_name":"Fast and Reduced-Complexity Decoding Rule for qary LDPC Codes by Using the Duality Properties","publication_year":2006,"publication_date":"2006-09-22","ids":{"openalex":"https://openalex.org/W2167388241","doi":"https://doi.org/10.1109/wimob.2006.1696346","mag":"2167388241"},"language":"en","primary_location":{"id":"doi:10.1109/wimob.2006.1696346","is_oa":false,"landing_page_url":"https://doi.org/10.1109/wimob.2006.1696346","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 Wireless and Mobile Computing, Networking and Communications, 2006. (WiMob'2006)","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/A5067621051","display_name":"Alaa Ghaith","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"A. Ghaith","raw_affiliation_strings":["ENST and CNRS, Lebanon"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ENST and CNRS, Lebanon","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5077116161","display_name":"Joseph J. Boutros","orcid":"https://orcid.org/0000-0002-6014-8328"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"J. Boutros","raw_affiliation_strings":["ENST, Paris, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ENST, Paris, France","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5051720261","display_name":"Yi Yuan-Wu","orcid":null},"institutions":[{"id":"https://openalex.org/I19370010","display_name":"Orange (France)","ror":"https://ror.org/035j0tq82","country_code":"FR","type":"company","lineage":["https://openalex.org/I19370010"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Yi Yuan-Wu","raw_affiliation_strings":["France Telecom Research and Development Center, Issy-les-Moulineaux, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"France Telecom Research and Development Center, Issy-les-Moulineaux, France","institution_ids":["https://openalex.org/I19370010"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3154,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.6810146,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"221","last_page":"228"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":1.0,"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":1.0,"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/T10125","display_name":"Advanced Wireless Communication Techniques","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.9994999766349792,"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/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.817055881023407},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.6932545900344849},{"id":"https://openalex.org/keywords/serial-concatenated-convolutional-codes","display_name":"Serial concatenated convolutional codes","score":0.6453218460083008},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6244156360626221},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.6168249249458313},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.5729503035545349},{"id":"https://openalex.org/keywords/sequential-decoding","display_name":"Sequential decoding","score":0.5345228314399719},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5108672976493835},{"id":"https://openalex.org/keywords/turbo-code","display_name":"Turbo code","score":0.5088646411895752},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.4819459915161133},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.432420551776886},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.38070905208587646},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.38047051429748535}],"concepts":[{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.817055881023407},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.6932545900344849},{"id":"https://openalex.org/C33529081","wikidata":"https://www.wikidata.org/wiki/Q18378194","display_name":"Serial concatenated convolutional codes","level":5,"score":0.6453218460083008},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6244156360626221},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.6168249249458313},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.5729503035545349},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.5345228314399719},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5108672976493835},{"id":"https://openalex.org/C114504821","wikidata":"https://www.wikidata.org/wiki/Q2164281","display_name":"Turbo code","level":3,"score":0.5088646411895752},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.4819459915161133},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.432420551776886},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.38070905208587646},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.38047051429748535}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/wimob.2006.1696346","is_oa":false,"landing_page_url":"https://doi.org/10.1109/wimob.2006.1696346","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 Wireless and Mobile Computing, Networking and Communications, 2006. (WiMob'2006)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W2114921205","https://openalex.org/W2115198523","https://openalex.org/W2121606987","https://openalex.org/W2126259959","https://openalex.org/W2127490352","https://openalex.org/W2128765501","https://openalex.org/W2135764410","https://openalex.org/W2140655888","https://openalex.org/W2153008566","https://openalex.org/W2156938362","https://openalex.org/W2293855776","https://openalex.org/W2987657883","https://openalex.org/W4245256025","https://openalex.org/W4256648168","https://openalex.org/W4300188436"],"related_works":["https://openalex.org/W2139406003","https://openalex.org/W2150212378","https://openalex.org/W2485298482","https://openalex.org/W2061476814","https://openalex.org/W2134727924","https://openalex.org/W2942886874","https://openalex.org/W792671342","https://openalex.org/W99853930","https://openalex.org/W1504657239","https://openalex.org/W2010879611"],"abstract_inverted_index":{"The":[0,113],"paper":[1],"studies":[2],"symbol-by-symbol":[3],"maximum":[4],"a":[5,29,68,76,106],"posteriori":[6],"(MAP)":[7],"decoding":[8,20,51,111],"algorithms":[9,44],"for":[10,49,81,128,159],"non":[11,171],"binary":[12,92,172],"codes":[13,94,97,173],"over":[14,28],"an":[15],"extension":[16],"field":[17],"GF(q).":[18],"This":[19],"rule":[21,117],"minimizes":[22],"the":[23,36,53,56,82,99,124,141,145,151],"probability":[24],"of":[25,55,79,115],"symbol":[26],"error":[27],"time-discrete":[30],"memory":[31],"less":[32],"channel":[33,66,101],"by":[34,139,149],"employing":[35],"dual":[37,142],"code.":[38],"It":[39,74],"is":[40,137,147],"shown":[41,89],"that":[42,135],"these":[43],"meet":[45],"all":[46],"requirements":[47],"needed":[48],"iterative":[50,165],"as":[52],"output":[54],"decoder":[57],"can":[58],"be":[59],"split":[60],"into":[61],"three":[62],"independent":[63],"estimates:":[64],"soft":[65],"value,":[67],"priori":[69],"term":[70],"and":[71,95,102,109,144,167],"extrinsic":[72],"value.":[73],"represents":[75],"better":[77],"form":[78],"coding":[80],"q-ary":[83],"LDPC":[84,93,168],"codes,":[85],"which":[86],"have":[87],"been":[88],"to":[90],"outperform":[91],"Reed-Solomon":[96],"on":[98],"AWGN":[100],"it":[103],"gives":[104],"us":[105],"new":[107],"fast":[108,152],"reduced-complexity":[110],"algorithm.":[112],"complexity":[114,136],"this":[116],"varies":[118],"inversely":[119],"with":[120],"code":[121],"rate,":[122],"making":[123],"technique":[125],"particularly":[126],"attractive":[127],"high":[129],"rate":[130],"codes.":[131],"Finally,":[132],"we":[133],"see":[134],"reduced":[138],"using":[140,150],"code,":[143],"algorithm":[146],"accelerated":[148],"Hadamard":[153],"transform":[154],"(FHT).":[155],"Examples":[156],"are":[157],"given":[158],"both":[160],"single":[161],"parity":[162],"check":[163],"(non":[164],"case)":[166,170],"(iterative":[169]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}