{"id":"https://openalex.org/W4415368746","doi":"https://doi.org/10.1109/isit63088.2025.11195639","title":"Improved Decoding of Tanner Codes","display_name":"Improved Decoding of Tanner Codes","publication_year":2025,"publication_date":"2025-06-22","ids":{"openalex":"https://openalex.org/W4415368746","doi":"https://doi.org/10.1109/isit63088.2025.11195639"},"language":null,"primary_location":{"id":"doi:10.1109/isit63088.2025.11195639","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit63088.2025.11195639","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE International Symposium on Information Theory (ISIT)","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":null,"display_name":"Zhaienhe Zhou","orcid":null},"institutions":[{"id":"https://openalex.org/I126520041","display_name":"University of Science and Technology of China","ror":"https://ror.org/04c4dkn09","country_code":"CN","type":"education","lineage":["https://openalex.org/I126520041","https://openalex.org/I19820366"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Zhaienhe Zhou","raw_affiliation_strings":["School of the Gifted Young &#x0026; College of Computer Science, University of Science and Technology of China,Hefei,China,230026"],"affiliations":[{"raw_affiliation_string":"School of the Gifted Young &#x0026; College of Computer Science, University of Science and Technology of China,Hefei,China,230026","institution_ids":["https://openalex.org/I126520041"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5004777401","display_name":"Zeyu Guo","orcid":"https://orcid.org/0000-0001-7893-4346"},"institutions":[{"id":"https://openalex.org/I52357470","display_name":"The Ohio State University","ror":"https://ror.org/00rs6vg23","country_code":"US","type":"education","lineage":["https://openalex.org/I52357470"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Zeyu Guo","raw_affiliation_strings":["The Ohio State University Columbus,Department of Computer Science and Engineering,OH,USA"],"affiliations":[{"raw_affiliation_string":"The Ohio State University Columbus,Department of Computer Science and Engineering,OH,USA","institution_ids":["https://openalex.org/I52357470"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I126520041"],"apc_list":null,"apc_paid":null,"fwci":1.3695,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.86829566,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9914000034332275,"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.9914000034332275,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9485999941825867,"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"}},{"id":"https://openalex.org/T10125","display_name":"Advanced Wireless Communication Techniques","score":0.9465000033378601,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.9151999950408936},{"id":"https://openalex.org/keywords/sequential-decoding","display_name":"Sequential decoding","score":0.6452000141143799},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.5957000255584717},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.5360999703407288},{"id":"https://openalex.org/keywords/berlekamp\u2013welch-algorithm","display_name":"Berlekamp\u2013Welch algorithm","score":0.5026999711990356},{"id":"https://openalex.org/keywords/radius","display_name":"RADIUS","score":0.4797999858856201},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.43160000443458557}],"concepts":[{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.9151999950408936},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.6452000141143799},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.621999979019165},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.5957000255584717},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.541100025177002},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.5360999703407288},{"id":"https://openalex.org/C132727834","wikidata":"https://www.wikidata.org/wiki/Q4892328","display_name":"Berlekamp\u2013Welch algorithm","level":5,"score":0.5026999711990356},{"id":"https://openalex.org/C178635117","wikidata":"https://www.wikidata.org/wiki/Q747499","display_name":"RADIUS","level":2,"score":0.4797999858856201},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.43160000443458557},{"id":"https://openalex.org/C3018063660","wikidata":"https://www.wikidata.org/wiki/Q6865448","display_name":"Minimum distance","level":2,"score":0.4034000039100647},{"id":"https://openalex.org/C153207627","wikidata":"https://www.wikidata.org/wiki/Q863873","display_name":"Code word","level":3,"score":0.3707999885082245},{"id":"https://openalex.org/C87117866","wikidata":"https://www.wikidata.org/wiki/Q7683664","display_name":"Tanner graph","level":5,"score":0.3481999933719635},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.313400000333786},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.29350000619888306},{"id":"https://openalex.org/C103088060","wikidata":"https://www.wikidata.org/wiki/Q1062839","display_name":"Error detection and correction","level":2,"score":0.27469998598098755},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.2709999978542328},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.25859999656677246},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.25839999318122864}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit63088.2025.11195639","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit63088.2025.11195639","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G8591307851","display_name":null,"funder_award_id":"CCF-2440926","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1993508000","https://openalex.org/W2031302740","https://openalex.org/W2102792260","https://openalex.org/W2103160098","https://openalex.org/W2138779125","https://openalex.org/W2169134868","https://openalex.org/W2169732368","https://openalex.org/W2173143580","https://openalex.org/W2293231900","https://openalex.org/W2734950220","https://openalex.org/W4317794910","https://openalex.org/W4415368746"],"related_works":[],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3,157,191,223],"present":[4],"improved":[5],"decoding":[6,19,114,119,136,226,230],"algorithms":[7,231],"for":[8,38],"expander-based":[9],"Tanner":[10,40,188,199],"codes.":[11,189],"We":[12,104],"begin":[13],"by":[14,133,163],"developing":[15],"a":[16,39,51,73,111,135,198],"randomized":[17],"linear-time":[18,113],"algorithm":[20,108,115,122,128],"that,":[21],"under":[22],"the":[23,87,107,117,125,145,159,164,184,194,217,225],"condition":[24],"that":[25,193],"<tex":[26,33,42,47,61,67,80,100,139,149,201,207,213,233,239],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[27,34,43,48,53,62,68,81,101,140,150,202,208,214,234,240],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$\\delta":[28,102],"d_{0}&gt;2$</tex>,":[29],"corrects":[30],"up":[31],"to":[32,109,179,237],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$\\alpha":[35,141,235],"n$</tex>":[36,236],"errors":[37],"code":[41,76,200],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$T\\left(G,":[44,203],"C_{0}\\right)$</tex>,":[45],"where":[46,212],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$G$</tex>":[49],"is":[50,72,205,216],"(<tex":[52],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$c,":[54],"d,":[55],"\\alpha,":[56],"\\delta$</tex>)":[57],"bipartite":[58],"expander":[59],"with":[60,77,116,144],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$n$</tex>":[63],"left":[64],"vertices,":[65],"and":[66,94,171,176],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$C_{0}":[69],"\\subseteq":[70],"\\mathbb{F}_{2}^{d}$</tex>":[71],"linear":[74],"inner":[75],"minimum":[78,185,195],"distance":[79,186,196],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$d_{0}$</tex>.":[82],"This":[83],"result":[84],"improves":[85,123],"upon":[86,124],"previous":[88,126,146],"work":[89,166],"of":[90,129,138,148,167,187,197,228],"Cheng,":[91,169],"Ouyang,":[92],"Shangguan,":[93],"Shen":[95],"(RANDOM":[96],"2024),":[97],"which":[98],"required":[99],"d_{0}&gt;3$</tex>.":[103],"further":[105],"derandomize":[106],"obtain":[110],"deterministic":[112,127],"same":[118],"radius.":[120],"Our":[121],"Cheng":[130],"et":[131],"al.":[132],"achieving":[134],"radius":[137,147,227],"n$</tex>,":[142,211],"compared":[143],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$\\frac{2":[151],"\\alpha}{d_{0}(1+0.5":[152],"c":[153],"\\delta)}":[154],"n$</tex>.":[155,243],"Additionally,":[156],"investigate":[158],"size-expansion":[160],"trade-off":[161],"introduced":[162],"recent":[165],"Chen,":[168],"Li,":[170],"Ouyang":[172],"(IEEE":[173],"TIT":[174],"2023),":[175],"use":[177],"it":[178],"provide":[180],"new":[181],"bounds":[182],"on":[183],"Specifically,":[190],"prove":[192],"C_{0}\\right)$</tex>":[204],"approximately":[206,238],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$f_{\\delta}^{-1}\\left(\\frac{1}{d_{0}}\\right)":[209],"\\alpha":[210,242],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$f_{\\delta}(\\cdot)$</tex>":[215],"Size-Expansion":[218],"Function.":[219],"As":[220],"another":[221],"application,":[222],"improve":[224],"our":[229],"from":[232],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$f_{\\delta}^{-1}\\left(\\frac{2}{d_{0}}\\right)":[241]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-04-21T08:09:41.155169","created_date":"2025-10-21T00:00:00"}