A proof of the Ahlswede-Cai-Zhang conjecture

Christoph Bunte, Amos Lapidoth, Alex Samorodnitsky

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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.

Original languageEnglish
Title of host publication2014 IEEE International Symposium on Information Theory, ISIT 2014
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages1116-1120
Number of pages5
ISBN (Print)9781479951864
DOIs
StatePublished - 2014
Externally publishedYes
Event2014 IEEE International Symposium on Information Theory, ISIT 2014 - Honolulu, HI, United States
Duration: 29 Jun 20144 Jul 2014

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8095

Conference

Conference2014 IEEE International Symposium on Information Theory, ISIT 2014
Country/TerritoryUnited States
CityHonolulu, HI
Period29/06/144/07/14

Fingerprint

Dive into the research topics of 'A proof of the Ahlswede-Cai-Zhang conjecture'. Together they form a unique fingerprint.

Cite this