The zero-undetected-error capacity approaches the sperner capacity

Christoph Bunte, Amos Lapidoth, Alex Samorodnitsky

Research output: Contribution to journalArticlepeer-review

8 Scopus citations


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.

Original languageAmerican English
Article number6812221
Pages (from-to)3825-3833
Number of pages9
JournalIEEE Transactions on Information Theory
Issue number7
StatePublished - Jul 2014


  • Sperner capacity
  • directed graphs
  • discrete memoryless channels
  • zero-undetected-error capacity


Dive into the research topics of 'The zero-undetected-error capacity approaches the sperner capacity'. Together they form a unique fingerprint.

Cite this