On the capacity of the binary adversarial wiretap channel
classification
💻 cs.IT
math.IT
keywords
binaryadversarialcapacitychannelcodewordfractionwiretapachievable
pith:Z4LHOFZ4 Add to your LaTeX paper
What is a Pith Number?\usepackage{pith}
\pithnumber{Z4LHOFZ4}
Prints a linked pith:Z4LHOFZ4 badge after your title and writes the identifier into PDF metadata. Compiles on arXiv with no extra files. Learn more
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.