arXiv Analytics

Sign in

arXiv:1801.03920 [cs.IT]AbstractReferencesReviewsResources

Inner Bound for the Capacity Region of Noisy Channels with an Authentication Requirement

Jake Perazzone, Eric Graves, Paul Yu, Rick Blum

Published 2018-01-11Version 1

The rate regions of many variations of the standard and wire-tap channels have been thoroughly explored. Secrecy capacity characterizes the loss of rate required to ensure that the adversary gains no information about the transmissions. Authentication does not have a standard metric, despite being an important counterpart to secrecy. While some results have taken an information-theoretic approach to the problem of authentication coding, the full rate region and accompanying trade-offs have yet to be characterized. In this paper, we provide an inner bound of achievable rates with an average authentication and reliability constraint. The bound is established by combining and analyzing two existing authentication schemes for both noisy and noiseless channels. We find that our coding scheme improves upon existing schemes.

Related articles: Most relevant | Search more
arXiv:1011.1225 [cs.IT] (Published 2010-11-04, updated 2012-09-05)
On the Capacity of Multiple-Access-Z-Interference Channels
arXiv:1201.6465 [cs.IT] (Published 2012-01-31, updated 2012-02-02)
An Information-Spectrum Approach to the Capacity Region of General Interference Channel
arXiv:1405.0203 [cs.IT] (Published 2014-05-01, updated 2015-10-11)
Binary Fading Interference Channel with No CSIT