{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,26]],"date-time":"2026-08-26T15:57:20Z","timestamp":1787759840609,"version":"build-2784847793"},"reference-count":29,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2022,5,1]],"date-time":"2022-05-01T00:00:00Z","timestamp":1651363200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,5,1]],"date-time":"2022-05-01T00:00:00Z","timestamp":1651363200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,5,1]],"date-time":"2022-05-01T00:00:00Z","timestamp":1651363200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"Italian Ministry of Education","award":["PRIN 2015 D72F16000790001"],"award-info":[{"award-number":["PRIN 2015 D72F16000790001"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2022,5]]},"DOI":"10.1109\/tit.2022.3145318","type":"journal-article","created":{"date-parts":[[2022,1,20]],"date-time":"2022-01-20T20:30:07Z","timestamp":1642710607000},"page":"2829-2838","source":"Crossref","is-referenced-by-count":5,"title":["A Revisitation of Low-Rate Bounds on the Reliability Function of Discrete Memoryless Channels for List Decoding"],"prefix":"10.1109","volume":"68","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4158-2487","authenticated-orcid":false,"given":"Marco","family":"Bondaschi","sequence":"first","affiliation":[{"name":"School of Computer and Communication Sciences, École Polytechnique Fédérale de Lausanne, Lausanne, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2132-7072","authenticated-orcid":false,"given":"Marco","family":"Dalai","sequence":"additional","affiliation":[{"name":"Department of Information Engineering, University of Brescia, Via Branze, Brescia, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/18.21233"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-7091-2945-6"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1965.1053730"},{"key":"ref4","article-title":"Block coding with noiseless feedback","author":"Berlekamp","year":"1964"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(67)90052-6"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(67)91200-4"},{"issue":"4","key":"ref7","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1023\/A:1013886231613","article-title":"Error probability exponent of list decoding at low rates","volume":"37","author":"Blinovsky","year":"2001","journal-title":"Problems Inf. Transmiss."},{"issue":"1","key":"ref8","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1023\/A:1020034020985","article-title":"New approach to estimation of the decoding error probability","volume":"38","author":"Blinovsky","year":"2002","journal-title":"Problems Inf. Transmiss."},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s11122-005-0007-5"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2902387"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2351393"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1973.1055056"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511921889"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.840876"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1977.1055792"},{"key":"ref16","volume-title":"Principles and Practice of Information Theory","author":"Blahut","year":"1987"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1968.1054148"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2410782"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78602-3"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/BF00383760"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2516560"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2868957"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849324"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ITA50056.2020.9244978"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9517804"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1956.1056798"},{"key":"ref27","article-title":"A note on a characterization of R\u00e9nyi measures and its relation to composite hypothesis testing","volume-title":"arXiv:1012.4401","author":"Shayevitz","year":"2010"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.2140\/pjm.1958.8.171"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53622-3"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/9760494\/09687534.pdf?arnumber=9687534","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,13]],"date-time":"2024-01-13T22:10:29Z","timestamp":1705183829000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9687534\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5]]},"references-count":29,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tit.2022.3145318","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,5]]}}}