{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:43:12Z","timestamp":1773376992565,"version":"3.50.1"},"reference-count":13,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T00:00:00Z","timestamp":1750550400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T00:00:00Z","timestamp":1750550400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF CAREER","doi-asserted-by":"publisher","award":["CCF-2440926"],"award-info":[{"award-number":["CCF-2440926"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,6,22]]},"DOI":"10.1109\/isit63088.2025.11195639","type":"proceedings-article","created":{"date-parts":[[2025,10,20]],"date-time":"2025-10-20T17:48:08Z","timestamp":1760982488000},"page":"1-6","source":"Crossref","is-referenced-by-count":1,"title":["Improved Decoding of Tanner Codes"],"prefix":"10.1109","author":[{"given":"Zhaienhe","family":"Zhou","sequence":"first","affiliation":[{"name":"School of the Gifted Young &#x0026; College of Computer Science, University of Science and Technology of China,Hefei,China,230026"}]},{"given":"Zeyu","family":"Guo","sequence":"additional","affiliation":[{"name":"The Ohio State University Columbus,Department of Computer Science and Engineering,OH,USA"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/18.556667"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2003.1216740"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/18.910577"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.842696"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.887523"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/2493252.2493255"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2013.01.012"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2023.3239163"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2040962"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2726064"},{"key":"ref11","first-page":"61:1","article-title":"When can an expander code correct $\\Omega(n)$ errors in $O(n)$ time?","author":"Cheng","year":"2024","journal-title":"in Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX\/RANDOM 2024)"},{"key":"ref12","doi-asserted-by":"crossref","DOI":"10.1109\/ISIT63088.2025.11195639","volume-title":"Improved decoding of tanner codes","author":"Zhou","year":"2025"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1966.1053873"}],"event":{"name":"2025 IEEE International Symposium on Information Theory (ISIT)","location":"Ann Arbor, MI, USA","start":{"date-parts":[[2025,6,22]]},"end":{"date-parts":[[2025,6,27]]}},"container-title":["2025 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11195206\/11195207\/11195639.pdf?arnumber=11195639","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:29:50Z","timestamp":1773347390000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11195639\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,22]]},"references-count":13,"URL":"https:\/\/doi.org\/10.1109\/isit63088.2025.11195639","relation":{},"subject":[],"published":{"date-parts":[[2025,6,22]]}}}