Abstract
The binary adder is a two-user multiple access channel whose inputs are binary and whose output is the real sum of the inputs. While the Shannon capacity region of this channel is well known, little is known regarding its zero-error capacity region, and a large gap remains between the best inner and outer bounds. In this paper, we provide an improved outer bound for this problem. To that end, we introduce a soft variation of the Saur-Perles-Shelah Lemma, that is then used in conjunction with an outer bound for the Shannon capacity region with an additional common message.
Original language | English |
---|---|
Title of host publication | Proceedings - 2015 IEEE International Symposium on Information Theory, ISIT 2015 |
Publisher | Institute of Electrical and Electronics Engineers Inc. |
Pages | 2366-2370 |
Number of pages | 5 |
ISBN (Electronic) | 9781467377041 |
DOIs | |
State | Published - 28 Sep 2015 |
Externally published | Yes |
Event | IEEE International Symposium on Information Theory, ISIT 2015 - Hong Kong, Hong Kong Duration: 14 Jun 2015 → 19 Jun 2015 |
Publication series
Name | IEEE International Symposium on Information Theory - Proceedings |
---|---|
Volume | 2015-June |
ISSN (Print) | 2157-8095 |
Conference
Conference | IEEE International Symposium on Information Theory, ISIT 2015 |
---|---|
Country/Territory | Hong Kong |
City | Hong Kong |
Period | 14/06/15 → 19/06/15 |
Bibliographical note
Publisher Copyright:© 2015 IEEE.