On the capacity of the binary adversarial wiretap channel

Carol Wang

On the capacity of the binary adversarial wiretap channel

Information Theory 2016-06-14 v2 math.IT

Authors: Carol Wang

Abstract

New bounds on the semantic secrecy capacity of the binary adversarial wiretap channel are established . Against an adversary which reads a $\rho_r$ fraction of the transmitted codeword and modifies a $\rho_w$ fraction of the codeword, we show an achievable rate of $1-h(\rho_w)-\rho_r$ , where $h(\cdot)$ is the binary entropy function. We also give an upper bound which is nearly matching when $\rho_r$ is small.

Keywords

binary adversarial wiretap channel semantic secrecy capacity achievable rate binary entropy function upper bound codeword corruption

Cite

@article{arxiv.1605.01330,
  title  = {On the capacity of the binary adversarial wiretap channel},
  author = {Carol Wang},
  journal= {arXiv preprint arXiv:1605.01330},
  year   = {2016}
}

Comments

v2: Capacity upper bound has been corrected

Related papers

View all related →