60 citations · 88 across the 5 of their papers we have counts for
Showing 2013 · cs.ITShow all
3 papers · 2 filters
cs.IT2013★ 1 cited
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…
cs.IT2013★ 10 cited
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…
cs.IT2013★ 16 cited
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…