{"id":"https://openalex.org/W2041426558","doi":"https://doi.org/10.1109/isit.2005.1523345","title":"Hybrid decoding of irregular LDPC codes","display_name":"Hybrid decoding of irregular LDPC codes","publication_year":2005,"publication_date":"2005-01-01","ids":{"openalex":"https://openalex.org/W2041426558","doi":"https://doi.org/10.1109/isit.2005.1523345","mag":"2041426558"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2005.1523345","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2005.1523345","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","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/A5077306578","display_name":"P. Zarrinkhat","orcid":null},"institutions":[{"id":"https://openalex.org/I2800055578","display_name":"Canadian Space Agency","ror":"https://ror.org/03a1gte98","country_code":"CA","type":"government","lineage":["https://openalex.org/I2800055578"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"P. Zarrinkhat","raw_affiliation_strings":["Canadian Space Agency, Saint Hubert, QUE, Canada","Canadian Space Agency, Saint-Hubert, Que.#TAB#"],"affiliations":[{"raw_affiliation_string":"Canadian Space Agency, Saint Hubert, QUE, Canada","institution_ids":["https://openalex.org/I2800055578"]},{"raw_affiliation_string":"Canadian Space Agency, Saint-Hubert, Que.#TAB#","institution_ids":["https://openalex.org/I2800055578"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5046274917","display_name":"Amir H. Banihashemi","orcid":"https://orcid.org/0000-0003-0685-5256"},"institutions":[{"id":"https://openalex.org/I67031392","display_name":"Carleton University","ror":"https://ror.org/02qtvee93","country_code":"CA","type":"education","lineage":["https://openalex.org/I67031392"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"A.H. Banihashemi","raw_affiliation_strings":["Broadband Communications and Wireless System Center, Department of Systems and Computer Engineering, Carleton University, Ottawa, ONT, Canada","(Carleton University)"],"affiliations":[{"raw_affiliation_string":"Broadband Communications and Wireless System Center, Department of Systems and Computer Engineering, Carleton University, Ottawa, ONT, Canada","institution_ids":["https://openalex.org/I67031392"]},{"raw_affiliation_string":"(Carleton University)","institution_ids":["https://openalex.org/I67031392"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5077306578"],"corresponding_institution_ids":["https://openalex.org/I2800055578"],"apc_list":null,"apc_paid":null,"fwci":0.7786,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.77067999,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"60","issue":null,"first_page":"312","last_page":"316"},"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.9980000257492065,"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9954000115394592,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.7361448407173157},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6493706107139587},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.6306114196777344},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5326945781707764},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.4487607777118683},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.4426558017730713},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3678770661354065},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3455405831336975},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3042045831680298},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.11894670128822327}],"concepts":[{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.7361448407173157},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6493706107139587},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.6306114196777344},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5326945781707764},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.4487607777118683},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.4426558017730713},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3678770661354065},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3455405831336975},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3042045831680298},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.11894670128822327},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2005.1523345","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2005.1523345","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","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":9,"referenced_works":["https://openalex.org/W30251028","https://openalex.org/W2115104320","https://openalex.org/W2127204517","https://openalex.org/W2127490352","https://openalex.org/W2128765501","https://openalex.org/W2137699000","https://openalex.org/W2161514549","https://openalex.org/W2167038527","https://openalex.org/W4300188436"],"related_works":["https://openalex.org/W2903058006","https://openalex.org/W2102374550","https://openalex.org/W2047069332","https://openalex.org/W2352157218","https://openalex.org/W4213381250","https://openalex.org/W2806845321","https://openalex.org/W4293418541","https://openalex.org/W2393084694","https://openalex.org/W2336709242","https://openalex.org/W4318215366"],"abstract_inverted_index":{"Time-invariant":[0],"hybrid":[1],"(H":[2],"<sub":[3,19,57,91,141],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[4,20,58,92,142],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">TI</sub>":[5,59,93,143],")":[6],"decoding":[7],"of":[8,45,54,84],"irregular":[9,96,111],"low-density":[10],"parity-check":[11],"(LDPC)":[12],"codes":[13],"is":[14,65,131],"studied.":[15],"Focusing":[16],"on":[17,51],"H":[18,56,90,140],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">TI":[21],"</sub>":[22],"algorithms":[23,60,74,94,103,144],"with":[24,81,152],"majority-based":[25],"(MB)":[26],"binary":[27],"message-passing":[28],"constituents,":[29],"we":[30],"use":[31],"density":[32],"evolution":[33],"and":[34,41,63,99,148,156],"finite-length":[35],"simulation":[36],"to":[37,76,109,119],"analyze":[38],"the":[39,42,52,68,82],"performance":[40],"convergence":[43],"properties":[44],"these":[46,73,102],"algorithms.":[47],"Tight":[48],"upper":[49],"bounds":[50],"threshold":[53],"MB":[55,89,137,139],"are":[61,145],"derived,":[62],"it":[64],"proven":[66],"that":[67,101,117],"asymptotic":[69],"error":[70],"probability":[71],"for":[72,95],"tends":[75],"zero":[77],"at":[78],"least":[79],"exponentially":[80],"number":[83],"iterations.":[85],"We":[86,114],"devise":[87],"optimal":[88],"LDPC":[97,112],"codes,":[98],"show":[100,116],"outperform":[104],"Gallager's":[105,124],"algorithm":[106,125],"A":[107],"applied":[108],"optimized":[110],"codes.":[113],"also":[115],"compared":[118],"switch-type":[120],"algorithms,":[121,138],"such":[122],"as":[123],"B,":[126],"where":[127],"a":[128],"comparable":[129],"improvement":[130],"obtained":[132],"by":[133],"switching":[134],"between":[135],"different":[136],"more":[146,161],"robust,":[147],"can":[149,158],"better":[150],"cope":[151],"unknown":[153],"channel":[154],"conditions,":[155],"thus":[157],"be":[159],"practically":[160],"attractive":[162]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}