{"id":"https://openalex.org/W2005328613","doi":"https://doi.org/10.1109/isit.2005.1523591","title":"Complexity-optimized low-density parity-check codes for gallager decoding algorithm B","display_name":"Complexity-optimized low-density parity-check codes for gallager decoding algorithm B","publication_year":2005,"publication_date":"2005-01-01","ids":{"openalex":"https://openalex.org/W2005328613","doi":"https://doi.org/10.1109/isit.2005.1523591","mag":"2005328613"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2005.1523591","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2005.1523591","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/A5004681822","display_name":"Wei Yu","orcid":"https://orcid.org/0000-0002-7453-422X"},"institutions":[{"id":"https://openalex.org/I185261750","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087","country_code":"CA","type":"education","lineage":["https://openalex.org/I185261750"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Wei Yu","raw_affiliation_strings":["Electrical and Computer Engineering Department, University of Toronto, Toronto, ONT, Canada","Dept of Electr. & Comput. Eng., Toronto Univ., Ont"],"affiliations":[{"raw_affiliation_string":"Electrical and Computer Engineering Department, University of Toronto, Toronto, ONT, Canada","institution_ids":["https://openalex.org/I185261750"]},{"raw_affiliation_string":"Dept of Electr. & Comput. Eng., Toronto Univ., Ont","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5008826983","display_name":"Masoud Ardakani","orcid":null},"institutions":[{"id":"https://openalex.org/I185261750","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087","country_code":"CA","type":"education","lineage":["https://openalex.org/I185261750"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"M. Ardakani","raw_affiliation_strings":["Electrical and Computer Engineering Department, University of Toronto, Toronto, ONT, Canada","Dept of Electr. & Comput. Eng., Toronto Univ., Ont"],"affiliations":[{"raw_affiliation_string":"Electrical and Computer Engineering Department, University of Toronto, Toronto, ONT, Canada","institution_ids":["https://openalex.org/I185261750"]},{"raw_affiliation_string":"Dept of Electr. & Comput. Eng., Toronto Univ., Ont","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5102803376","display_name":"Benjamin Smith","orcid":"https://orcid.org/0000-0002-6633-4033"},"institutions":[{"id":"https://openalex.org/I185261750","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087","country_code":"CA","type":"education","lineage":["https://openalex.org/I185261750"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"B. Smith","raw_affiliation_strings":["Electrical and Computer Engineering Department, University of Toronto, Toronto, ONT, Canada","Dept of Electr. & Comput. Eng., Toronto Univ., Ont"],"affiliations":[{"raw_affiliation_string":"Electrical and Computer Engineering Department, University of Toronto, Toronto, ONT, Canada","institution_ids":["https://openalex.org/I185261750"]},{"raw_affiliation_string":"Dept of Electr. & Comput. Eng., Toronto Univ., Ont","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5077846751","display_name":"Frank R. Kschischang","orcid":"https://orcid.org/0000-0002-4274-1785"},"institutions":[{"id":"https://openalex.org/I185261750","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087","country_code":"CA","type":"education","lineage":["https://openalex.org/I185261750"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"F. Kschischang","raw_affiliation_strings":["Electrical and Computer Engineering Department, University of Toronto, Toronto, ONT, Canada","Dept of Electr. & Comput. Eng., Toronto Univ., Ont"],"affiliations":[{"raw_affiliation_string":"Electrical and Computer Engineering Department, University of Toronto, Toronto, ONT, Canada","institution_ids":["https://openalex.org/I185261750"]},{"raw_affiliation_string":"Dept of Electr. & Comput. Eng., Toronto Univ., Ont","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5004681822"],"corresponding_institution_ids":["https://openalex.org/I185261750"],"apc_list":null,"apc_paid":null,"fwci":1.6424,"has_fulltext":false,"cited_by_count":30,"citation_normalized_percentile":{"value":0.86291781,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"1488","last_page":"1492"},"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.9995999932289124,"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.9973999857902527,"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/decoding-methods","display_name":"Decoding methods","score":0.792264461517334},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6869927644729614},{"id":"https://openalex.org/keywords/sequential-decoding","display_name":"Sequential decoding","score":0.681194543838501},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.6749928593635559},{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.656168520450592},{"id":"https://openalex.org/keywords/binary-symmetric-channel","display_name":"Binary symmetric channel","score":0.6016993522644043},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.48362982273101807},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4783848524093628},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.4749194085597992},{"id":"https://openalex.org/keywords/exit-chart","display_name":"EXIT chart","score":0.4572768211364746},{"id":"https://openalex.org/keywords/berlekamp\u2013welch-algorithm","display_name":"Berlekamp\u2013Welch algorithm","score":0.4349009394645691},{"id":"https://openalex.org/keywords/parity-check-matrix","display_name":"Parity-check matrix","score":0.4172554910182953},{"id":"https://openalex.org/keywords/code-rate","display_name":"Code rate","score":0.41379058361053467},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4116480350494385},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3361096978187561},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.2163492739200592},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.15390971302986145},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.13078591227531433}],"concepts":[{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.792264461517334},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6869927644729614},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.681194543838501},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.6749928593635559},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.656168520450592},{"id":"https://openalex.org/C173988684","wikidata":"https://www.wikidata.org/wiki/Q863510","display_name":"Binary symmetric channel","level":4,"score":0.6016993522644043},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.48362982273101807},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4783848524093628},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.4749194085597992},{"id":"https://openalex.org/C171401667","wikidata":"https://www.wikidata.org/wiki/Q5324684","display_name":"EXIT chart","level":5,"score":0.4572768211364746},{"id":"https://openalex.org/C132727834","wikidata":"https://www.wikidata.org/wiki/Q4892328","display_name":"Berlekamp\u2013Welch algorithm","level":5,"score":0.4349009394645691},{"id":"https://openalex.org/C95925971","wikidata":"https://www.wikidata.org/wiki/Q3100414","display_name":"Parity-check matrix","level":4,"score":0.4172554910182953},{"id":"https://openalex.org/C206468330","wikidata":"https://www.wikidata.org/wiki/Q834373","display_name":"Code rate","level":3,"score":0.41379058361053467},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4116480350494385},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3361096978187561},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.2163492739200592},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.15390971302986145},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.13078591227531433}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/isit.2005.1523591","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2005.1523591","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"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.318.8620","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.318.8620","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.comm.utoronto.ca/~weiyu/IT055882.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W2022381080","https://openalex.org/W2101394529","https://openalex.org/W2115104320","https://openalex.org/W2122637421","https://openalex.org/W2126259959","https://openalex.org/W2127490352","https://openalex.org/W2128765501","https://openalex.org/W2137699000","https://openalex.org/W2139769859","https://openalex.org/W2148095386","https://openalex.org/W2158669549","https://openalex.org/W2169732368","https://openalex.org/W4300188436","https://openalex.org/W6680817461"],"related_works":["https://openalex.org/W2160839632","https://openalex.org/W2118148379","https://openalex.org/W2159737200","https://openalex.org/W2122637421","https://openalex.org/W2744658369","https://openalex.org/W2097218458","https://openalex.org/W1624259157","https://openalex.org/W2538179194","https://openalex.org/W1646184777","https://openalex.org/W2106026583"],"abstract_inverted_index":{"The":[0,39,80],"complexity-rate":[1,147],"tradeoff":[2],"for":[3,35,57,104,152],"error-correcting":[4],"codes":[5],"below":[6],"the":[7,46,75,84,93,99,105,123,132,146,153,162,174],"Shannon":[8],"limit":[9],"is":[10,44,67,87,120,127],"a":[11,26,52,88,110,115,128,136],"central":[12],"question":[13],"in":[14,21,135],"coding":[15],"theory.":[16],"This":[17,69,140],"paper":[18,43],"makes":[19],"progress":[20],"this":[22,42],"area":[23],"by":[24],"presenting":[25],"joint":[27],"numerical":[28],"optimization":[29,85,163],"of":[30,41,54,71,83,101,131,138,169],"rate":[31],"and":[32,50],"decoding":[33,55,72,77,106,156],"complexity":[34,89,125,167],"low-density":[36],"parity-check":[37],"codes.":[38],"focus":[40],"on":[45,51,92,158],"binary":[47,159],"symmetric":[48,160],"channel":[49],"class":[53,70],"algorithms":[56,73],"which":[58],"an":[59],"exact":[60],"extrinsic":[61],"information":[62],"transfer":[63],"(EXIT)":[64],"chart":[65,95],"analysis":[66],"possible.":[68],"includes":[74],"Gallager":[76,154],"algorithm":[78,107,157],"B.":[79],"main":[81],"feature":[82],"method":[86,178],"measure":[90,126],"based":[91],"EXIT":[94],"that":[96,122,151],"accurately":[97],"estimates":[98],"number":[100],"iterations":[102],"required":[103],"to":[108,143,173],"reach":[109],"target":[111],"error":[112],"rate.":[113],"Under":[114],"fixed":[116],"check-degree":[117],"distribution,":[118],"it":[119],"shown":[121],"proposed":[124],"convex":[129],"function":[130],"variable-degree":[133],"distribution":[134],"region":[137],"interest.":[139],"allows":[141],"us":[142],"numerically":[144],"characterize":[145],"tradeoff.":[148],"We":[149],"show":[150],"B":[155],"channels,":[161],"procedure":[164],"can":[165],"produce":[166],"savings":[168],"30-40%":[170],"as":[171],"compared":[172],"conventional":[175],"code":[176],"design":[177]},"counts_by_year":[{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}