A Proof of the Ahlswede-Cai-Zhang Conjecture

Jump to other IT Society Websites:

A Proof of the Ahlswede-Cai-Zhang Conjecture

Author(s):

Creation Date: Aug 15, 2014

Published In: Jul 2014

Paper Type: Conference Paper

Book Title: Proc. of IEEE International Symposium on Information Theory

Address: Honolulu, Hawaii

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. 

Award(s) Received:

COVID-19 Updates

Read important changes and updates to the 2020 activities of the IEEE Information Theory Society due to the COVID-19 pandemic at:

https://www.itsoc.org/covid

 

Table of Contents

IEEE TechNav