{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:37:47Z","timestamp":1773376667928,"version":"3.50.1"},"reference-count":11,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,6,25]],"date-time":"2023-06-25T00:00:00Z","timestamp":1687651200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,6,25]],"date-time":"2023-06-25T00:00:00Z","timestamp":1687651200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,6,25]]},"DOI":"10.1109\/isit54713.2023.10206871","type":"proceedings-article","created":{"date-parts":[[2023,8,22]],"date-time":"2023-08-22T13:31:15Z","timestamp":1692711075000},"page":"15-18","source":"Crossref","is-referenced-by-count":3,"title":["Optimal List Decoding from Noisy Entropy Inequality"],"prefix":"10.1109","author":[{"given":"Jan","family":"H\u0105z\u0142a","sequence":"first","affiliation":[{"name":"AIMS Rwanda,Kigali,Rwanda"}]}],"member":"263","reference":[{"key":"ref8","article-title":"An improved bound on `q norms of noisy functions","author":"samorodnitsky","year":"2020"},{"key":"ref7","article-title":"Reed–Muller codes achieve capacity on BMS channels","author":"reeves","year":"2021"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2944698"},{"key":"ref4","article-title":"A criterion for decoding on the BSC","author":"rao","year":"2022"},{"key":"ref3","author":"samorodnitsky","year":"0","journal-title":"Personal communication"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2673829"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4939-7005-6_7"},{"key":"ref5","first-page":"1479","article-title":"On codes decoding a constant fraction of errors on the BSC","author":"haz??","year":"2021","journal-title":"Symposium on Theory of Computing (STOC)"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541387"},{"key":"ref2","article-title":"On some properties of random and pseudorandom codes","author":"samorodnitsky","year":"2022"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2584625"}],"event":{"name":"2023 IEEE International Symposium on Information Theory (ISIT)","location":"Taipei, Taiwan","start":{"date-parts":[[2023,6,25]]},"end":{"date-parts":[[2023,6,30]]}},"container-title":["2023 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10206429\/10206441\/10206871.pdf?arnumber=10206871","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:27:30Z","timestamp":1773347250000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10206871\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,25]]},"references-count":11,"URL":"https:\/\/doi.org\/10.1109\/isit54713.2023.10206871","relation":{},"subject":[],"published":{"date-parts":[[2023,6,25]]}}}