{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T08:25:25Z","timestamp":1761294325505,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":27,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,6,15]],"date-time":"2021-06-15T00:00:00Z","timestamp":1623715200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,6,15]]},"DOI":"10.1145\/3406325.3451015","type":"proceedings-article","created":{"date-parts":[[2021,6,16]],"date-time":"2021-06-16T01:26:13Z","timestamp":1623806773000},"page":"1479-1488","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["On codes decoding a constant fraction of errors on the BSC"],"prefix":"10.1145","author":[{"given":"Jan","family":"H\u0105z\u0142a","sequence":"first","affiliation":[{"name":"EPFL, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alex","family":"Samorodnitsky","sequence":"additional","affiliation":[{"name":"Hebrew University of Jerusalem, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ori","family":"Sberlo","sequence":"additional","affiliation":[{"name":"Tel Aviv University, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,6,15]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Stochastic block model entropy and broadcasting on trees with survey","author":"Abbe Emmanuel","year":"2021","unstructured":"Emmanuel Abbe, Elisabetta Cornacchia, Yuzhou Gu, and Yury Polyanskiy. 2021. Stochastic block model entropy and broadcasting on trees with survey. 2021."},{"key":"e_1_3_2_1_2_1","volume-title":"Almost\u2013Reed\u2013Muller codes achieve constant rates for random errors","author":"Abbe Emmanuel","year":"2020","unstructured":"Emmanuel Abbe, Jan H\u0105z\u0142a, and Ido Nachum. 2020. Almost\u2013Reed\u2013Muller codes achieve constant rates for random errors. 2020."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2462817"},{"key":"e_1_3_2_1_4_1","volume-title":"Reed\u2013Muller codes: Theory and algorithms","author":"Abbe Emmanuel","year":"2020","unstructured":"Emmanuel Abbe, Amir Shpilka, and Min Ye. 2020. Reed\u2013Muller codes: Theory and algorithms. IEEE Transactions on Information Theory, 2020."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2021379"},{"key":"e_1_3_2_1_6_1","first-page":"3","article-title":"Influences of variables and threshold intervals under group symmetries","volume":"7","author":"Bourgain Jean","year":"1997","unstructured":"Jean Bourgain and Gil Kalai. 1997. Influences of variables and threshold intervals under group symmetries. Geometric & Functional Analysis GAFA, 7, 3, 1997. Pages 438\u2013461.","journal-title":"Geometric & Functional Analysis GAFA"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(70)90214-7"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.4171\/JEMS\/915"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9939-96-03732-X"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/LCOM.2007.348296"},{"key":"e_1_3_2_1_11_1","volume-title":"Error detecting and error correcting codes. Bell System technical journal, 29, 2","author":"Hamming Richard W","year":"1950","unstructured":"Richard W Hamming. 1950. Error detecting and error correcting codes. Bell System technical journal, 29, 2, 1950. Pages 147\u2013160."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2184841"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.568707"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2673829"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541600"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.748992"},{"key":"e_1_3_2_1_17_1","first-page":"1954","article-title":"Application of Boolean algebra to switching circuit design and to error detection","volume":"3","author":"Muller David E","year":"1954","unstructured":"David E Muller. 1954. Application of Boolean algebra to switching circuit design and to error detection. Transactions of the IRE Professional Group on Electronic Computers, EC-3, 3, 1954. Pages 6\u201312.","journal-title":"Transactions of the IRE Professional Group on Electronic Computers, EC-3"},{"volume-title":"Matroid theory. 3","author":"Oxley James G","key":"e_1_3_2_1_18_1","unstructured":"James G Oxley. 2006. Matroid theory. 3, Oxford University Press, USA."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1954.1057465"},{"volume-title":"Modern Coding Theory","author":"Richardson Tom","key":"e_1_3_2_1_20_1","unstructured":"Tom Richardson and R\u00fcdiger Urbanke. 2008. Modern Coding Theory. Cambridge University Press."},{"key":"e_1_3_2_1_21_1","first-page":"5","article-title":"Threshold for monotone symmetric properties through a logarithmic Sobolev inequality","volume":"34","author":"Rossignol Rapha\u00ebl","year":"2005","unstructured":"Rapha\u00ebl Rossignol. 2005. Threshold for monotone symmetric properties through a logarithmic Sobolev inequality. The Annals of Probability, 34, 5, 2005. Pages 1707\u20131725.","journal-title":"The Annals of Probability"},{"key":"e_1_3_2_1_22_1","first-page":"2","article-title":"An upper bound on \\ell _q norms of noisy functions","volume":"66","author":"Samorodnitsky Alex","year":"2019","unstructured":"Alex Samorodnitsky. 2019. An upper bound on \\ell _q norms of noisy functions. IEEE Transactions on Information Theory, 66, 2, 2019. Pages 742\u2013748.","journal-title":"IEEE Transactions on Information Theory"},{"key":"e_1_3_2_1_23_1","volume-title":"An improved bound on \\ell _q norms of noisy functions","author":"Samorodnitsky Alex","year":"2020","unstructured":"Alex Samorodnitsky. 2020. An improved bound on \\ell _q norms of noisy functions. 2020."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975994.82"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1948.tb01338.x"},{"key":"e_1_3_2_1_26_1","volume-title":"Convergence of iterative decoding. Electronics letters, 35, 10","author":"Brink Stephan Ten","year":"1999","unstructured":"Stephan Ten Brink. 1999. Convergence of iterative decoding. Electronics letters, 35, 10, 1999. Pages 806\u2013808."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548300004466"}],"event":{"name":"STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Virtual Italy","acronym":"STOC '21"},"container-title":["Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3406325.3451015","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3406325.3451015","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:01:44Z","timestamp":1750197704000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3406325.3451015"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,15]]},"references-count":27,"alternative-id":["10.1145\/3406325.3451015","10.1145\/3406325"],"URL":"https:\/\/doi.org\/10.1145\/3406325.3451015","relation":{},"subject":[],"published":{"date-parts":[[2021,6,15]]},"assertion":[{"value":"2021-06-15","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}