{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,26]],"date-time":"2026-08-26T16:16:07Z","timestamp":1787760967732,"version":"build-2784847793"},"reference-count":21,"publisher":"MDPI AG","issue":"1","license":[{"start":{"date-parts":[[2021,12,24]],"date-time":"2021-12-24T00:00:00Z","timestamp":1640304000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>The listsize capacity is computed for the Gaussian channel with a helper that\u2014cognizant of the channel-noise sequence but not of the transmitted message\u2014provides the decoder with a rate-limited description of said sequence. This capacity is shown to equal the sum of the cutoff rate of the Gaussian channel without help and the rate of help. In particular, zero-rate help raises the listsize capacity from zero to the cutoff rate. This is achieved by having the helper provide the decoder with a sufficiently fine quantization of the normalized squared Euclidean norm of the noise sequence.<\/jats:p>","DOI":"10.3390\/e24010029","type":"journal-article","created":{"date-parts":[[2021,12,24]],"date-time":"2021-12-24T08:38:46Z","timestamp":1640335126000},"page":"29","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["The Listsize Capacity of the Gaussian Channel with Decoder Assistance"],"prefix":"10.3390","volume":"24","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4742-5124","authenticated-orcid":false,"given":"Amos","family":"Lapidoth","sequence":"first","affiliation":[{"name":"Signal and Information Processing Laboratory, ETH Zurich, 8092 Zurich, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yiming","family":"Yan","sequence":"additional","affiliation":[{"name":"Signal and Information Processing Laboratory, ETH Zurich, 8092 Zurich, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"1968","published-online":{"date-parts":[[2021,12,24]]},"reference":[{"key":"ref_1","unstructured":"Gallager, R.G. (1968). Information Theory and Reliable Communication, John Wiley & Sons, Inc."},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Verd\u00fa, S. (2021). Error exponents and \u03b1-mutual information. Entropy, 23.","DOI":"10.3390\/e23020199"},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Lapidoth, A., Marti, G., and Yan, Y. (2021, January 12\u201320). Other helper capacities. Proceedings of the 2021 IEEE International Symposium on Information Theory (ISIT), Victoria, Australia.","DOI":"10.1109\/ISIT45174.2021.9517712"},{"key":"ref_4","unstructured":"Cover, T.M. (2006). Elements of Information Theory, John Wiley & Sons, Inc.. [2nd ed.]."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"1328","DOI":"10.1109\/TIT.2007.915921","article-title":"Capacity of a class of deterministic relay channels","volume":"54","author":"Kim","year":"2008","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"4150","DOI":"10.1109\/TCOMM.2020.2984215","article-title":"Decoder-assisted communications over additive noise channels","volume":"68","author":"Bross","year":"2020","journal-title":"IEEE Trans. Commun."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"6607","DOI":"10.1109\/TIT.2020.3012629","article-title":"Encoder-assisted communications over additive noise channels","volume":"66","author":"Lapidoth","year":"2020","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"7019","DOI":"10.1109\/TIT.2021.3111541","article-title":"On error exponents of encoder-assisted communication systems","volume":"67","author":"Merhav","year":"2021","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"5065","DOI":"10.1109\/TIT.2014.2329490","article-title":"Encoding tasks and R\u00e9nyi entropy","volume":"60","author":"Bunte","year":"2014","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_10","first-page":"20","article-title":"Transmission capacity with zero error and erasure","volume":"6","author":"Pinsker","year":"1970","journal-title":"Probl. Peredachi Informatsii"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1109\/18.370120","article-title":"Channel capacity for a given decoding metric","volume":"41","author":"Csiszar","year":"1995","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"1977","DOI":"10.1109\/18.641560","article-title":"Zero-error list capacities of discrete memoryless channels","volume":"43","author":"Telatar","year":"1997","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1109\/18.481778","article-title":"Erasure, list, and detection zero-error capacities for low noise and a relation to identification","volume":"42","author":"Ahlswede","year":"1996","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"3825","DOI":"10.1109\/TIT.2014.2322624","article-title":"The zero-undetected-error capacity approaches the Sperner capacity","volume":"60","author":"Bunte","year":"2014","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1109\/TIT.2011.2169529","article-title":"Errors-and-erasures decoding for block codes with feedback","volume":"58","author":"Zheng","year":"2012","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Bunte, C., and Lapidoth, A. (2012, January 1\u20135). The zero-undetected-error capacity of discrete memoryless channels with feedback. Proceedings of the 2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton), Monticello, IL, USA.","DOI":"10.1109\/Allerton.2012.6483445"},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"6733","DOI":"10.1109\/TIT.2014.2355815","article-title":"On the listsize capacity with feedback","volume":"60","author":"Bunte","year":"2014","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"3003","DOI":"10.1109\/TIT.2006.876349","article-title":"Duality bounds on the cutoff rate with applications to Ricean fading","volume":"52","author":"Lapidoth","year":"2006","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_19","unstructured":"Pfister, C. (2019). On R\u00e9nyi Information Measures and Their Applications. [Ph.D. Thesis, ETH Zurich]."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1007\/BF02771562","article-title":"On the subspaces of Lp (p > 2) spanned by sequences of independent random variables","volume":"8","author":"Rosenthal","year":"1970","journal-title":"Isr. J. Math."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1109\/18.481781","article-title":"An inequality on guessing and its application to sequential decoding","volume":"42","year":"1996","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/24\/1\/29\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T07:52:54Z","timestamp":1760169174000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/24\/1\/29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,12,24]]},"references-count":21,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2022,1]]}},"alternative-id":["e24010029"],"URL":"https:\/\/doi.org\/10.3390\/e24010029","relation":{},"ISSN":["1099-4300"],"issn-type":[{"value":"1099-4300","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,12,24]]}}}