{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,30]],"date-time":"2025-09-30T12:40:01Z","timestamp":1759236001260,"version":"3.44.0"},"reference-count":57,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"10","license":[{"start":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T00:00:00Z","timestamp":1759276800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T00:00:00Z","timestamp":1759276800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T00:00:00Z","timestamp":1759276800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"National Key Research and Development Program of China","award":["2021YFA1001000"],"award-info":[{"award-number":["2021YFA1001000"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12231014"],"award-info":[{"award-number":["12231014"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62472008"],"award-info":[{"award-number":["62472008"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2025,10]]},"DOI":"10.1109\/tit.2025.3586842","type":"journal-article","created":{"date-parts":[[2025,7,7]],"date-time":"2025-07-07T13:49:20Z","timestamp":1751896160000},"page":"7626-7643","source":"Crossref","is-referenced-by-count":0,"title":["When Can an Expander Code Correct <i>\u03a9(n)<\/i> Errors in <i>O(n)<\/i> Time?"],"prefix":"10.1109","volume":"71","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1569-0580","authenticated-orcid":false,"given":"Yuanting","family":"Shen","sequence":"first","affiliation":[{"name":"Research Center for Mathematics and Interdisciplinary Sciences, Shandong University, Qingdao, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3206-3968","authenticated-orcid":false,"given":"Chong","family":"Shangguan","sequence":"additional","affiliation":[{"name":"Research Center for Mathematics and Interdisciplinary Sciences, Shandong University, Qingdao, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3439-3653","authenticated-orcid":false,"given":"Minghui","family":"Ouyang","sequence":"additional","affiliation":[{"name":"School of Mathematical Sciences, Peking University, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8972-1749","authenticated-orcid":false,"given":"Kuan","family":"Cheng","sequence":"additional","affiliation":[{"name":"School of Computer Science, Peking University, Haidian, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1962.1057683"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/4234.905935"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2181819"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/18.910575"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS46700.2020.00050"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/18.910578"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/18.910577"},{"key":"ref8","article-title":"Iterative decoding of low-density parity check codes (A survey)","author":"Guruswami","year":"2006","journal-title":"arXiv:cs\/0610022"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1981.1056404"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/18.556667"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/18.556668"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.887523"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/2493252.2493255"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2040962"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2726064"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2023.3239163"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1995.492581"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/509907.510023"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.878232"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2208584"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3086805"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2013.01.012"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/18.910593"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3097347"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1103\/PRXQuantum.2.040101"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/3564246.3585101"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1137\/20M1383689"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/3564246.3585169"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/3406325.3451005"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/3406325.3451029"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2015.55"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS54457.2022.00117"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2023.3267945"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977554.ch45"},{"key":"ref35","article-title":"Good quantum LDPC codes with linear time decoder from lossless expanders","author":"Lin","year":"2022","journal-title":"arXiv:2203.03581"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3119384"},{"key":"ref37","article-title":"Locally testable codes via high-dimensional expanders","author":"Dikstein","year":"2020","journal-title":"arXiv:2005.01045"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/3519935.3520024"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT50566.2022.9834679"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1145\/3519935.3520017"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(88)90189-6"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2003.1216740"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374424"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1145\/3188745.3188782"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1007\/BF02126799"},{"issue":"4","key":"ref46","first-page":"71","article-title":"Explicit constructions of expanders (Russian), problemy peredaci informacii","volume":"9","author":"Margulis","year":"1973","journal-title":"MR0484767"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1006\/jctb.1994.1054"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2000.892006"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/ITA.2008.4601075"},{"issue":"1","key":"ref50","first-page":"51","article-title":"Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and concentrators","volume":"24","author":"Margulis","year":"1988","journal-title":"Problemy Peredachi Informatsii"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2002.1004327"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS57990.2023.00100"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977912.177"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2002.1181884"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.3390\/e26040348"},{"key":"ref56","article-title":"Simple constructions of unique neighbor expanders from error-correcting codes","author":"Kopparty","year":"2023","journal-title":"arXiv:2310.19149"},{"issue":"301","key":"ref57","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1080\/01621459.1963.10500830","article-title":"Probability inequal. For sums of bounded random variables","volume":"58","author":"Hoeffding","year":"1963","journal-title":"J. Amer. Stat. Assoc."}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/18\/11175289\/11072482.pdf?arnumber=11072482","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,30]],"date-time":"2025-09-30T12:24:01Z","timestamp":1759235041000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11072482\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10]]},"references-count":57,"journal-issue":{"issue":"10"},"URL":"https:\/\/doi.org\/10.1109\/tit.2025.3586842","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"type":"print","value":"0018-9448"},{"type":"electronic","value":"1557-9654"}],"subject":[],"published":{"date-parts":[[2025,10]]}}}