On the Listsize Capacity With Feedback

DOI10.1109/TIT.2014.2355815MaRDI QIDQ2983316zbMATH OpenFDO

Authors Christoph Bunte, Amos Lapidoth

Publication date 16 May 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1311.0195

Mathematics Subject Classification ID

Measures of information, entropy (94A17)

Abstract: The listsize capacity of a discrete memoryless channel is the largest transmission rate for which the expectation---or, more generally, the $ho$-th moment---of the number of messages that could have produced the output of the channel approaches one as the blocklength tends to infinity. We show that for channels with feedback this rate is upper-bounded by the maximum of Gallager's $E_0$ function divided by $ho$, and that equality holds when the zero-error capacity of the channel is positive. To establish this inequality we prove that feedback does not increase the cutoff rate. Relationships to other notions of channel capacity are explored.

This page was built for publication: On the Listsize Capacity With Feedback

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2983316)