{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,23]],"date-time":"2025-06-23T16:10:05Z","timestamp":1750695005359,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":59,"publisher":"ACM","funder":[{"name":"NSF (National Science Foundation)","award":["2326685"],"award-info":[{"award-number":["2326685"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,6,15]]},"DOI":"10.1145\/3717823.3718302","type":"proceedings-article","created":{"date-parts":[[2025,6,15]],"date-time":"2025-06-15T23:34:42Z","timestamp":1750030482000},"page":"843-854","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Explicit Codes Approaching Generalized Singleton Bound using Expanders"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8586-1533","authenticated-orcid":false,"given":"Fernando Granha","family":"Jeronimo","sequence":"first","affiliation":[{"name":"UIUC, Urbana-Champaign, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4017-2662","authenticated-orcid":false,"given":"Tushant","family":"Mittal","sequence":"additional","affiliation":[{"name":"Stanford University, Stanford, USA"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-3882-5126","authenticated-orcid":false,"given":"Shashank","family":"Srivastava","sequence":"additional","affiliation":[{"name":"Rutgers University, New Brunswick, USA"},{"name":"Institute for Advanced Study, Princeton, USA"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-3094-8835","authenticated-orcid":false,"given":"Madhur","family":"Tulsiani","sequence":"additional","affiliation":[{"name":"TTIC, Chicago, USA"}]}],"member":"320","published-online":{"date-parts":[[2025,6,15]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.119713"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1995.492581"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977912.55"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3618260.3649634"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3618260.3649680"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT57864.2024.10619167"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2023.3345890"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2024.3449030"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3564246.3585128"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","unstructured":"Yeyuan Chen and Zihan Zhang. 2024. Explicit Folded Reed-Solomon and Multiplicity Codes Achieve Relaxed Generalized Singleton Bounds. arxiv:2408.15925.","DOI":"10.1145\/3717823.3718114"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/780542.780563"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2214010"},{"key":"e_1_3_2_1_13_1","unstructured":"Peter Elias. 1957. List Decoding for Noisy Channels. Research Laboratory of Electronics MIT."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS52979.2021.00075"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1561\/0400000086"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3222877"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","unstructured":"P. Gopalan V. Guruswami and P. Raghavendra. 2009. List Decoding Tensor Products and Interleaved Codes. In STOC \u201909. Association for Computing Machinery New York NY USA. 13\u201322. isbn:9781605585062 https:\/\/doi.org\/10.1145\/1536414.1536419 10.1145\/1536414.1536419","DOI":"10.1145\/1536414.1536419"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974782.135"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1137\/21M1463707"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3406325.3451046"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS57990.2023.00019"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1561\/0400000007"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536420"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.855587"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2095170"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.855587"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-014-3169-1"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2343224"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132516.1132518"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.911222"},{"key":"e_1_3_2_1_31_1","unstructured":"Venkatesan Guruswami Atri Rudra and Madhu Sudan. 2023. Essential Coding Theory. Available at https:\/\/cse.buffalo.edu\/faculty\/atri\/courses\/coding-theory\/book\/"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.782097"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","unstructured":"Venkatesan Guruswami Christopher Umans and Salil Vadhan. 2009. Unbalanced expanders and randomness extractors from Parvaresh\u2013Vardy codes. J. ACM https:\/\/doi.org\/10.1145\/1538902.1538904 10.1145\/1538902.1538904","DOI":"10.1145\/1538902.1538904"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2246813"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488715"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/3506668"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2018.02.004"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS57990.2023.00102"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2015.v011a005"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897523"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2018.00029"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1137\/20M1370215"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/2629416"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02126799"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS46700.2020.00050"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2005.29"},{"key":"e_1_3_2_1_47_1","first-page":"300","article-title":"Polynomial Codes over Certain Finite Fields","volume":"8","author":"Reed I.S.","year":"1960","unstructured":"I.S. Reed and G. Solomon. 1960. Polynomial Codes over Certain Finite Fields. Journal of SIAM, 8 (1960), 300\u2013304.","journal-title":"Journal of SIAM"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3194521"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591797"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/3357713.3384295"},{"volume-title":"Continuous Optimization for Decoding Errors. Ph. D. Dissertation","author":"Srivastava Shashank","key":"e_1_3_2_1_51_1","unstructured":"Shashank Srivastava. 2024. Continuous Optimization for Decoding Errors. Ph. D. Dissertation. Toyota Technlogical Institute at Chicago (TTIC). arxiv:2408.14652."},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611978322.64"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcom.1997.0439"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/346048.346049"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2024.3402171"},{"key":"e_1_3_2_1_56_1","volume-title":"Some Applications of Coding Theory in Computational Complexity. Quaderni di Matematica, 13","author":"Trevisan Luca","year":"2004","unstructured":"Luca Trevisan. 2004. Some Applications of Coding Theory in Computational Complexity. Quaderni di Matematica, 13 (2004), 347\u2013424. arxiv:cs.CC\/0409044."},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"crossref","unstructured":"Salil P. Vadhan. 2012. Pseudorandomness. Now Publishers Inc.. isbn:1601985940","DOI":"10.1561\/9781601985958"},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488716"},{"key":"e_1_3_2_1_59_1","unstructured":"J. M. Wozencraft. 1958. List Decoding. Quarterly Progress Report Research Laboratory of Electronics MIT."}],"event":{"name":"STOC '25: 57th Annual ACM Symposium on Theory of Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Prague Czechia","acronym":"STOC '25"},"container-title":["Proceedings of the 57th Annual ACM Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3717823.3718302","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,23]],"date-time":"2025-06-23T15:49:48Z","timestamp":1750693788000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3717823.3718302"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,15]]},"references-count":59,"alternative-id":["10.1145\/3717823.3718302","10.1145\/3717823"],"URL":"https:\/\/doi.org\/10.1145\/3717823.3718302","relation":{},"subject":[],"published":{"date-parts":[[2025,6,15]]},"assertion":[{"value":"2025-06-15","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}