The zero-undetected-error capacity approaches the sperner capacity

Christoph Bunte; Amos Lapidoth; Alex Samorodnitsky

doi:https://doi.org/10.1109/TIT.2014.2322624

The zero-undetected-error capacity approaches the sperner capacity

Christoph Bunte, Amos Lapidoth, Alex Samorodnitsky

The Rachel and Selim Benin School of Engineering and Computer Science

The Hebrew University of Jerusalem

Research output: Contribution to journal › Article › 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
Article number	6812221
Pages (from-to)	3825-3833
Number of pages	9
Journal	IEEE Transactions on Information Theory
Volume	60
Issue number	7
DOIs	https://doi.org/10.1109/TIT.2014.2322624
State	Published - Jul 2014

Keywords

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

All Science Journal Classification (ASJC) codes

Information Systems
Computer Science Applications
Library and Information Sciences

Access to Document

https://doi.org/10.1109/TIT.2014.2322624

Cite this

@article{010825a1845145b193ad040464f76f50,

title = "The zero-undetected-error capacity approaches the sperner capacity",

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 = "Sperner capacity, directed graphs, discrete memoryless channels, zero-undetected-error capacity",

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

year = "2014",

month = jul,

doi = "https://doi.org/10.1109/TIT.2014.2322624",

language = "الإنجليزيّة",

volume = "60",

pages = "3825--3833",

journal = "IEEE Transactions on Information Theory",

issn = "0018-9448",

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

number = "7",

}

TY - JOUR

T1 - The zero-undetected-error capacity approaches the sperner capacity

AU - Bunte, Christoph

AU - Lapidoth, Amos

AU - Samorodnitsky, Alex

PY - 2014/7

Y1 - 2014/7

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.

KW - Sperner capacity

KW - directed graphs

KW - discrete memoryless channels

KW - zero-undetected-error capacity

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

U2 - https://doi.org/10.1109/TIT.2014.2322624

DO - https://doi.org/10.1109/TIT.2014.2322624

M3 - مقالة

SN - 0018-9448

VL - 60

SP - 3825

EP - 3833

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

IS - 7

M1 - 6812221

ER -

The zero-undetected-error capacity approaches the sperner capacity

Abstract

Keywords

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this