A proof of the Ahlswede-Cai-Zhang conjecture

Christoph Bunte; Amos Lapidoth; Alex Samorodnitsky

doi:10.1109/ISIT.2014.6875006

A proof of the Ahlswede-Cai-Zhang conjecture

Christoph Bunte, Amos Lapidoth, Alex Samorodnitsky

The Rachel and Selim Benin School of Engineering and Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-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 language	English
Title of host publication	2014 IEEE International Symposium on Information Theory, ISIT 2014
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	1116-1120
Number of pages	5
ISBN (Print)	9781479951864
DOIs	https://doi.org/10.1109/ISIT.2014.6875006
State	Published - 2014
Event	2014 IEEE International Symposium on Information Theory, ISIT 2014 - Honolulu, HI, United States Duration: 29 Jun 2014 → 4 Jul 2014

Publication series

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

Conference

Conference	2014 IEEE International Symposium on Information Theory, ISIT 2014
Country/Territory	United States
City	Honolulu, HI
Period	29/06/14 → 4/07/14

Access to Document

10.1109/ISIT.2014.6875006

Cite this

@inproceedings{292d5ca9c282494a9b4f0f18e6e31567,

title = "A proof of the Ahlswede-Cai-Zhang conjecture",

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.",

author = "Christoph Bunte and Amos Lapidoth and Alex Samorodnitsky",

year = "2014",

doi = "10.1109/ISIT.2014.6875006",

language = "אנגלית",

isbn = "9781479951864",

series = "IEEE International Symposium on Information Theory - Proceedings",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "1116--1120",

booktitle = "2014 IEEE International Symposium on Information Theory, ISIT 2014",

address = "ארצות הברית",

note = "2014 IEEE International Symposium on Information Theory, ISIT 2014 ; Conference date: 29-06-2014 Through 04-07-2014",

}

Bunte, C, Lapidoth, A & Samorodnitsky, A 2014, A proof of the Ahlswede-Cai-Zhang conjecture. in 2014 IEEE International Symposium on Information Theory, ISIT 2014., 6875006, IEEE International Symposium on Information Theory - Proceedings, Institute of Electrical and Electronics Engineers Inc., pp. 1116-1120, 2014 IEEE International Symposium on Information Theory, ISIT 2014, Honolulu, HI, United States, 29/06/14. https://doi.org/10.1109/ISIT.2014.6875006

A proof of the Ahlswede-Cai-Zhang conjecture. / Bunte, Christoph; Lapidoth, Amos; Samorodnitsky, Alex.
2014 IEEE International Symposium on Information Theory, ISIT 2014. Institute of Electrical and Electronics Engineers Inc., 2014. p. 1116-1120 6875006 (IEEE International Symposium on Information Theory - Proceedings).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - A proof of the Ahlswede-Cai-Zhang conjecture

AU - Bunte, Christoph

AU - Lapidoth, Amos

AU - Samorodnitsky, Alex

PY - 2014

Y1 - 2014

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84906545089&partnerID=8YFLogxK

U2 - 10.1109/ISIT.2014.6875006

DO - 10.1109/ISIT.2014.6875006

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84906545089

SN - 9781479951864

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 1116

EP - 1120

BT - 2014 IEEE International Symposium on Information Theory, ISIT 2014

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 2014 IEEE International Symposium on Information Theory, ISIT 2014

Y2 - 29 June 2014 through 4 July 2014

ER -

A proof of the Ahlswede-Cai-Zhang conjecture

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this