{"id":"https://openalex.org/W2152705823","doi":"https://doi.org/10.1109/tit.2011.2165813","title":"Analysis of Verification-Based Decoding on the $q$-ary Symmetric Channel for Large $q$","display_name":"Analysis of Verification-Based Decoding on the $q$-ary Symmetric Channel for Large $q$","publication_year":2011,"publication_date":"2011-10-01","ids":{"openalex":"https://openalex.org/W2152705823","doi":"https://doi.org/10.1109/tit.2011.2165813","mag":"2152705823"},"language":"en","primary_location":{"id":"doi:10.1109/tit.2011.2165813","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2011.2165813","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-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/A5100604053","display_name":"Fan Zhang","orcid":"https://orcid.org/0000-0002-8576-0273"},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Fan Zhang","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Texas A&M University, College Station, TX, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Texas A&M University, College Station, TX, USA","institution_ids":["https://openalex.org/I91045830"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5034044119","display_name":"Henry D. Pfister","orcid":"https://orcid.org/0000-0001-5521-4397"},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Henry D. Pfister","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Texas A&M University, College Station, TX, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Texas A&M University, College Station, TX, USA","institution_ids":["https://openalex.org/I91045830"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.5599,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.90413258,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"57","issue":"10","first_page":"6754","last_page":"6770"},"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.9983999729156494,"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.9983000159263611,"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.8189979195594788},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.7651215195655823},{"id":"https://openalex.org/keywords/binary-erasure-channel","display_name":"Binary erasure channel","score":0.662875771522522},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6563980579376221},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5734248161315918},{"id":"https://openalex.org/keywords/sequential-decoding","display_name":"Sequential decoding","score":0.5368832349777222},{"id":"https://openalex.org/keywords/binary-symmetric-channel","display_name":"Binary symmetric channel","score":0.5216056108474731},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.5006725788116455},{"id":"https://openalex.org/keywords/erasure","display_name":"Erasure","score":0.47399961948394775},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.45499899983406067},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.42728352546691895},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.4190734624862671},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.4125717580318451},{"id":"https://openalex.org/keywords/channel-capacity","display_name":"Channel capacity","score":0.3836325407028198},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.33373409509658813},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3300809860229492},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.2755078077316284},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.19509673118591309},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.15156430006027222},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.12110522389411926}],"concepts":[{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.8189979195594788},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.7651215195655823},{"id":"https://openalex.org/C149862233","wikidata":"https://www.wikidata.org/wiki/Q864142","display_name":"Binary erasure channel","level":4,"score":0.662875771522522},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6563980579376221},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5734248161315918},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.5368832349777222},{"id":"https://openalex.org/C173988684","wikidata":"https://www.wikidata.org/wiki/Q863510","display_name":"Binary symmetric channel","level":4,"score":0.5216056108474731},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.5006725788116455},{"id":"https://openalex.org/C2778790127","wikidata":"https://www.wikidata.org/wiki/Q484885","display_name":"Erasure","level":2,"score":0.47399961948394775},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.45499899983406067},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.42728352546691895},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.4190734624862671},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.4125717580318451},{"id":"https://openalex.org/C97744766","wikidata":"https://www.wikidata.org/wiki/Q870845","display_name":"Channel capacity","level":3,"score":0.3836325407028198},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.33373409509658813},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3300809860229492},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.2755078077316284},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.19509673118591309},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.15156430006027222},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.12110522389411926},{"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/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tit.2011.2165813","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2011.2165813","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W5090298","https://openalex.org/W1536930200","https://openalex.org/W1572884776","https://openalex.org/W1595159159","https://openalex.org/W1979720612","https://openalex.org/W1991468147","https://openalex.org/W1994091697","https://openalex.org/W2101395301","https://openalex.org/W2107086875","https://openalex.org/W2107325154","https://openalex.org/W2112858600","https://openalex.org/W2114981480","https://openalex.org/W2115104320","https://openalex.org/W2127490352","https://openalex.org/W2128765501","https://openalex.org/W2135764410","https://openalex.org/W2142903341","https://openalex.org/W2151961505","https://openalex.org/W2157711553","https://openalex.org/W2158669549","https://openalex.org/W2163095709","https://openalex.org/W2167467706","https://openalex.org/W2169732368","https://openalex.org/W2173776306","https://openalex.org/W2502955786","https://openalex.org/W6677157393"],"related_works":["https://openalex.org/W2583282232","https://openalex.org/W2042522304","https://openalex.org/W2028268383","https://openalex.org/W2372190485","https://openalex.org/W2104345270","https://openalex.org/W2952102465","https://openalex.org/W3103136794","https://openalex.org/W2137028263","https://openalex.org/W2141877208","https://openalex.org/W2226710168"],"abstract_inverted_index":{"A":[0],"new":[1],"verification-based":[2,130],"message-passing":[3],"decoder":[4,29,48],"for":[5,14,46,72,87,98,186],"low-density":[6],"parity-check":[7],"(LDPC)":[8],"codes":[9],"is":[10,62,104,163,179,196],"introduced":[11,133],"and":[12,35,51,136,155,166,209],"analyzed":[13],"the":[15,58,73,84,99,119,123,148,172,176,184,193],"q-ary":[16],"symmetric":[17],"channel":[18,76],"(q-SC).":[19],"Rather":[20],"than":[21],"passing":[22],"messages":[23],"consisting":[24],"of":[25,32,159,175,201],"symbol":[26],"probabilities,":[27],"this":[28,47,146],"passes":[30],"lists":[31,38],"possible":[33],"symbols":[34],"marks":[36],"some":[37],"as":[39],"verified.":[40],"The":[41,90,157],"density":[42,206],"evolution":[43,207],"(DE)":[44],"equations":[45],"are":[49,93,114,151,168],"derived":[50],"used":[52,79,181],"to":[53,80,106,117,142,170,182],"compute":[54],"decoding":[55,91,131],"thresholds.":[56],"If":[57],"maximum":[59,109,189],"list":[60,103,190],"size":[61],"unbounded,":[63],"then":[64],"one":[65],"finds":[66],"that":[67,138],"any":[68],"capacity-achieving":[69],"LDPC":[70],"code":[71],"binary":[74],"erasure":[75],"can":[77],"be":[78,143],"achieve":[81],"capacity":[82],"on":[83],"q":[85],"-SC":[86],"large":[88],"q.":[89],"thresholds":[92,208],"also":[94,115,164,180],"computed":[95],"via":[96,153],"DE":[97,120],"case":[100],"where":[101],"each":[102],"truncated":[105],"satisfy":[107],"a":[108,187,199],"list-size":[110],"constraint.":[111],"Simulation":[112],"results":[113],"presented":[116],"confirm":[118],"results.":[121,211],"During":[122],"simulations,":[124],"we":[125],"observed":[126],"differences":[127],"between":[128],"two":[129],"algorithms,":[132],"by":[134],"Luby":[135],"Mitzenmacher,":[137],"were":[139],"implicitly":[140],"assumed":[141],"identical.":[144],"In":[145],"paper,":[147],"node-based":[149],"algorithms":[150,203],"evaluated":[152],"analysis":[154],"simulation.":[156],"probability":[158],"false":[160],"verification":[161],"(FV)":[162],"considered":[165],"techniques":[167],"discussed":[169],"mitigate":[171],"FV.":[173],"Optimization":[174],"degree":[177],"distribution":[178],"improve":[183],"threshold":[185],"fixed":[188],"size.":[191],"Finally,":[192],"proposed":[194],"algorithm":[195],"compared":[197],"with":[198],"variety":[200],"other":[202],"using":[204],"both":[205],"simulation":[210]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2019,"cited_by_count":3},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":6}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}