The Zero-Undetected-Error Capacity Approaches the Sperner Capacity

DOI10.1109/TIT.2014.2322624zbMATH Open1360.94146arXiv1309.4930OpenAlexW2021282228MaRDI QIDQ2986252FDOQ2986252

Authors: Christoph Bunte, Amos Lapidoth, Alex Samorodnitsky 

Publication date: 16 May 2017

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

Abstract: 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 conjectured equality. Here we derive an upper bound that proves the conjecture.

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

Mathematics Subject Classification ID

Measures of information, entropy (94A17)

This page was built for publication: The Zero-Undetected-Error Capacity Approaches the Sperner Capacity

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