Title :
A proof of the Ahlswede-Cai-Zhang conjecture
Author :
Bunte, Christoph ; Lapidoth, Amos ; Samorodnitsky, Alex
Author_Institution :
ETH Zurich, Zurich, Switzerland
fDate :
June 29 2014-July 4 2014
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.
Keywords :
channel capacity; channel coding; graph theory; Ahlswede-Cai-Zhang conjecture; Sperner capacity; channel graph; conjectured equality; noise-free limit; zero-undetected-error capacity; Capacity planning; Decoding; Educational institutions; Electronic mail; Monte Carlo methods; Upper bound;
Conference_Titel :
Information Theory (ISIT), 2014 IEEE International Symposium on
Conference_Location :
Honolulu, HI
DOI :
10.1109/ISIT.2014.6875006
