{"id":"https://openalex.org/W2086044750","doi":"https://doi.org/10.1109/itw.2012.6404721","title":"Approaching maximum likelihood decoding of finite length LDPC codes via FAID diversity","display_name":"Approaching maximum likelihood decoding of finite length LDPC codes via FAID diversity","publication_year":2012,"publication_date":"2012-09-01","ids":{"openalex":"https://openalex.org/W2086044750","doi":"https://doi.org/10.1109/itw.2012.6404721","mag":"2086044750"},"language":"en","primary_location":{"id":"doi:10.1109/itw.2012.6404721","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itw.2012.6404721","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE Information Theory Workshop","raw_type":"proceedings-article"},"type":"preprint","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/A5022930542","display_name":"David Declercq","orcid":"https://orcid.org/0000-0001-7645-7136"},"institutions":[{"id":"https://openalex.org/I4210142324","display_name":"CY Cergy Paris Universit\u00e9","ror":"https://ror.org/043htjv09","country_code":"FR","type":"education","lineage":["https://openalex.org/I4210142324"]},{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I86175216","display_name":"\u00c9cole Nationale Sup\u00e9rieure de l'\u00c9lectronique et de ses Applications","ror":"https://ror.org/03qeacd72","country_code":"FR","type":"education","lineage":["https://openalex.org/I86175216"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"David Declercq","raw_affiliation_strings":["ETIS, ENSEA/UCP/CNRS UMR 8051, Cergy-Pontoise, France","ETIS ENSEA/UCP/CNRS UMR-8051, 95014 Cergy-Pontoise, France"],"affiliations":[{"raw_affiliation_string":"ETIS, ENSEA/UCP/CNRS UMR 8051, Cergy-Pontoise, France","institution_ids":["https://openalex.org/I86175216","https://openalex.org/I4210142324","https://openalex.org/I1294671590"]},{"raw_affiliation_string":"ETIS ENSEA/UCP/CNRS UMR-8051, 95014 Cergy-Pontoise, France","institution_ids":["https://openalex.org/I86175216","https://openalex.org/I4210142324","https://openalex.org/I1294671590"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5090137603","display_name":"Erbao Li","orcid":null},"institutions":[{"id":"https://openalex.org/I4210142324","display_name":"CY Cergy Paris Universit\u00e9","ror":"https://ror.org/043htjv09","country_code":"FR","type":"education","lineage":["https://openalex.org/I4210142324"]},{"id":"https://openalex.org/I86175216","display_name":"\u00c9cole Nationale Sup\u00e9rieure de l'\u00c9lectronique et de ses Applications","ror":"https://ror.org/03qeacd72","country_code":"FR","type":"education","lineage":["https://openalex.org/I86175216"]},{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1294671590"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Erbao Li","raw_affiliation_strings":["ETIS, ENSEA/UCP/CNRS UMR 8051, Cergy-Pontoise, France","ETIS ENSEA/UCP/CNRS UMR-8051, 95014 Cergy-Pontoise, France"],"affiliations":[{"raw_affiliation_string":"ETIS, ENSEA/UCP/CNRS UMR 8051, Cergy-Pontoise, France","institution_ids":["https://openalex.org/I86175216","https://openalex.org/I4210142324","https://openalex.org/I1294671590"]},{"raw_affiliation_string":"ETIS ENSEA/UCP/CNRS UMR-8051, 95014 Cergy-Pontoise, France","institution_ids":["https://openalex.org/I86175216","https://openalex.org/I4210142324","https://openalex.org/I1294671590"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5110440574","display_name":"Bane Vasic","orcid":null},"institutions":[{"id":"https://openalex.org/I138006243","display_name":"University of Arizona","ror":"https://ror.org/03m2x1q45","country_code":"US","type":"education","lineage":["https://openalex.org/I138006243"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Bane Vasic","raw_affiliation_strings":["Department of ECE, University of Arizona, Tucson, AZ, USA","Dept. of ECE, University of Arizona, Tucson, 85721, USA"],"affiliations":[{"raw_affiliation_string":"Department of ECE, University of Arizona, Tucson, AZ, USA","institution_ids":["https://openalex.org/I138006243"]},{"raw_affiliation_string":"Dept. of ECE, University of Arizona, Tucson, 85721, USA","institution_ids":["https://openalex.org/I138006243"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5110166745","display_name":"Shiva Kumar Planjery","orcid":null},"institutions":[{"id":"https://openalex.org/I138006243","display_name":"University of Arizona","ror":"https://ror.org/03m2x1q45","country_code":"US","type":"education","lineage":["https://openalex.org/I138006243"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Shiva K. Planjery","raw_affiliation_strings":["Department of ECE, University of Arizona, Tucson, AZ, USA","Dept. of ECE, University of Arizona, Tucson, 85721, USA"],"affiliations":[{"raw_affiliation_string":"Department of ECE, University of Arizona, Tucson, AZ, USA","institution_ids":["https://openalex.org/I138006243"]},{"raw_affiliation_string":"Dept. of ECE, University of Arizona, Tucson, 85721, USA","institution_ids":["https://openalex.org/I138006243"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5022930542"],"corresponding_institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I4210142324","https://openalex.org/I86175216"],"apc_list":null,"apc_paid":null,"fwci":1.1148,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.80370766,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"487","last_page":"491"},"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/T10125","display_name":"Advanced Wireless Communication Techniques","score":0.996999979019165,"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/T12162","display_name":"Cellular Automata and Applications","score":0.9872999787330627,"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/belief-propagation","display_name":"Belief propagation","score":0.8097240924835205},{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.7710356712341309},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.766929030418396},{"id":"https://openalex.org/keywords/message-passing","display_name":"Message passing","score":0.5932065844535828},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5327050089836121},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5286327600479126},{"id":"https://openalex.org/keywords/alphabet","display_name":"Alphabet","score":0.5107219219207764},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.4484623670578003},{"id":"https://openalex.org/keywords/attractor","display_name":"Attractor","score":0.42316934466362},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3981413245201111},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.36837440729141235},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3395411968231201},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.0900227427482605}],"concepts":[{"id":"https://openalex.org/C152948882","wikidata":"https://www.wikidata.org/wiki/Q4060686","display_name":"Belief propagation","level":3,"score":0.8097240924835205},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.7710356712341309},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.766929030418396},{"id":"https://openalex.org/C854659","wikidata":"https://www.wikidata.org/wiki/Q1859284","display_name":"Message passing","level":2,"score":0.5932065844535828},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5327050089836121},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5286327600479126},{"id":"https://openalex.org/C112876837","wikidata":"https://www.wikidata.org/wiki/Q837518","display_name":"Alphabet","level":2,"score":0.5107219219207764},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.4484623670578003},{"id":"https://openalex.org/C164380108","wikidata":"https://www.wikidata.org/wiki/Q507187","display_name":"Attractor","level":2,"score":0.42316934466362},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3981413245201111},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.36837440729141235},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3395411968231201},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.0900227427482605},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/itw.2012.6404721","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itw.2012.6404721","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE Information Theory Workshop","raw_type":"proceedings-article"},{"id":"pmh:oai:HAL:hal-00764115v1","is_oa":false,"landing_page_url":"https://hal.science/hal-00764115","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ITW'12, Sep 2012, Lausanne, Switzerland","raw_type":"Conference papers"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Quality Education","id":"https://metadata.un.org/sdg/4","score":0.5799999833106995}],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1484692004","https://openalex.org/W1536890176","https://openalex.org/W1973338115","https://openalex.org/W1996465640","https://openalex.org/W2024074584","https://openalex.org/W2071304218","https://openalex.org/W2085273837","https://openalex.org/W2099308299","https://openalex.org/W2102688401","https://openalex.org/W2147164626","https://openalex.org/W2148855255","https://openalex.org/W2152993703","https://openalex.org/W2553702736","https://openalex.org/W2566505556","https://openalex.org/W3101626161","https://openalex.org/W4285719527","https://openalex.org/W6628810906"],"related_works":["https://openalex.org/W2011305240","https://openalex.org/W2885795561","https://openalex.org/W2050010277","https://openalex.org/W2163364417","https://openalex.org/W2963109230","https://openalex.org/W2336199159","https://openalex.org/W2896991873","https://openalex.org/W2572298685","https://openalex.org/W2122977448","https://openalex.org/W4286892381"],"abstract_inverted_index":{"We":[0,88],"introduce":[1],"a":[2,30,60],"generic":[3],"approach,":[4],"called":[5],"FAID":[6,94],"diversity,":[7],"for":[8,110],"improving":[9],"the":[10,21,73,80,93,101,105],"error":[11],"correction":[12],"capability":[13],"of":[14,32,103,107],"regular":[15],"low-density":[16],"parity":[17],"check":[18],"codes,":[19],"beyond":[20],"belief":[22],"propagation":[23],"performance.":[24],"The":[25,38],"method":[26],"relies":[27],"on":[28,59],"operating":[29],"set":[31],"finite":[33],"alphabet":[34],"iterative":[35,74],"decoders":[36,55],"(FAID).":[37],"message-passing":[39],"update":[40],"rules":[41],"are":[42,49],"interpreted":[43],"as":[44],"discrete":[45],"dynamical":[46],"systems,":[47],"and":[48],"judiciously":[50],"chosen":[51],"to":[52],"ensure":[53],"that":[54,79,92],"have":[56],"different":[57],"dynamics":[58],"specific":[61],"finite-length":[62,111],"code.":[63],"An":[64],"algorithm":[65],"is":[66,82],"proposed":[67],"which":[68],"uses":[69],"random":[70,98],"jumps":[71,99],"in":[72,85],"message":[75],"passing":[76],"trajectories,":[77],"such":[78],"system":[81],"not":[83],"trapped":[84],"periodic":[86],"attractors.":[87],"show":[89],"by":[90],"simulations":[91],"diversity":[95],"approach":[96],"with":[97],"has":[100],"potential":[102],"approaching":[104],"performance":[106],"maximum-likelihood":[108],"decoding":[109],"regular,":[112],"column-weight":[113],"three":[114],"codes.":[115]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}