60 citations · 72 across the 4 of their papers we have counts for
5 papers
Maximum Rényi Entropy Rate
Christoph Bunte, Amos Lapidoth
Two maximization problems of Rényi entropy rate are investigated: the maximization over all stochastic processes whose marginals satisfy a linear constraint, and the Burg-like maxi…
Encoding Tasks and Rényi Entropy
Christoph Bunte, Amos Lapidoth
A task is randomly drawn from a finite set of tasks and is described using a fixed number of bits. All the tasks that share its description must be performed. Upper and lower bound…
Codes for Tasks and Rényi Entropy Rate
Christoph Bunte, Amos Lapidoth
A task is randomly drawn from a finite set of tasks and is described using a fixed number of bits. All the tasks that share its description must be performed. Upper and lower bound…
On the Listsize Capacity with Feedback
Christoph Bunte, Amos Lapidoth
The listsize capacity of a discrete memoryless channel is the largest transmission rate for which the expectation---or, more generally, the -th moment---of the number of message…
The Zero-Undetected-Error Capacity Approaches the Sperner Capacity
Christoph Bunte, Amos Lapidoth, Alex Samorodnitsky
Ahlswede, Cai, and Zhang proved that, in the noise-free limit, the zero-undetected-error capacity is lower bounded by the Sperner capacity of the channel graph, and they conjecture…