{"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":"conference-paper","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":false,"raw_author_name":"Zhaienhe Zhou","raw_affiliation_strings":["School of the Gifted Young & College of Computer Science, University of Science and Technology of China,Hefei,China,230026"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of the Gifted Young & 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"],"raw_orcid":null,"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":[],"apc_list":null,"apc_paid":null,"fwci":3.8811,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.94545589,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":91,"max":97},"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/G437997621","display_name":"CAREER: Algebraic Pseudorandomness in Complexity and Coding Theory","funder_award_id":"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,121,155,176],"present":[4],"improved":[5],"decoding":[6,19,84,89,106,179,183],"algorithms":[7,184],"for":[8,31],"expander-based":[9],"Tanner":[10,33,152,163],"codes.":[11,153],"We":[12,74],"begin":[13],"by":[14,103,127],"developing":[15],"a":[16,32,37,49,81,105,162],"randomized":[17],"linear-time":[18,83],"algorithm":[20,78,85,92,98],"that,":[21],"under":[22],"the":[23,60,77,87,95,112,123,128,148,158,170,178],"condition":[24],"that$\\delta":[25],"d_{0}>2$,":[26],"corrects":[27],"up":[28],"to$\\alpha":[29],"n$errors":[30],"code$T\\left(G,":[34,164],"C_{0}\\right)$,":[35],"where$G$is":[36],"($c,":[38],"d,":[39],"\\alpha,":[40],"\\delta$)":[41],"bipartite":[42],"expander":[43],"with$n$left":[44],"vertices,":[45],"and$C_{0}":[46],"\\subseteq":[47],"\\mathbb{F}_{2}^{d}$is":[48],"linear":[50],"inner":[51],"code":[52],"with":[53,86,111],"minimum":[54,149,159],"distance$d_{0}$.":[55],"This":[56],"result":[57],"improves":[58,93],"upon":[59,94],"previous":[61,96,113],"work":[62,130],"of":[63,99,131,151,161,181],"Cheng,":[64,133],"Ouyang,":[65],"Shangguan,":[66],"and":[67,135,140],"Shen":[68],"(RANDOM":[69],"2024),":[70],"which":[71],"required$\\delta":[72],"d_{0}>3$.":[73],"further":[75],"derandomize":[76],"to":[79,143],"obtain":[80],"deterministic":[82,97],"same":[88],"radius.":[90],"Our":[91],"Cheng":[100],"et":[101],"al.":[102],"achieving":[104],"radius":[107,114,180],"of$\\alpha":[108],"n$,":[109,168],"compared":[110],"of$\\frac{2":[115],"\\alpha}{d_{0}(1+0.5":[116],"c":[117],"\\delta)}":[118],"n$.":[119,189],"Additionally,":[120],"investigate":[122],"size-expansion":[124],"trade-off":[125],"introduced":[126],"recent":[129],"Chen,":[132],"Li,":[134],"Ouyang":[136],"(IEEE":[137],"TIT":[138],"2023),":[139],"use":[141],"it":[142],"provide":[144],"new":[145],"bounds":[146],"on":[147],"distance":[150,160],"Specifically,":[154],"prove":[156],"that":[157],"C_{0}\\right)$is":[165],"approximately$f_{\\delta}^{-1}\\left(\\frac{1}{d_{0}}\\right)":[166],"\\alpha":[167,188],"where$f_{\\delta}(\\cdot)$is":[169],"Size-Expansion":[171],"Function.":[172],"As":[173],"another":[174],"application,":[175],"improve":[177],"our":[182],"from$\\alpha":[185],"n$to":[186],"approximately$f_{\\delta}^{-1}\\left(\\frac{2}{d_{0}}\\right)":[187]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1}],"updated_date":"2026-08-06T08:24:18.245995","created_date":"2025-10-21T00:00:00"}