MAC Resolvability: First And Second Order Results
Information Theory
2018-01-15 v2 math.IT
Abstract
Building upon previous work on the relation between secrecy and channel resolvability, we revisit a secrecy proof for the multiple-access channel from the perspective of resolvability. We then refine the approach in order to obtain some novel results on the second-order achievable rates.
Cite
@article{arxiv.1707.04156,
title = {MAC Resolvability: First And Second Order Results},
author = {Matthias Frey and Igor Bjelakovic and Slawomir Stanczak},
journal= {arXiv preprint arXiv:1707.04156},
year = {2018}
}
Comments
Slightly extended version of the paper accepted at the 4th Workshop on Physical-Layer Methods for Wireless Security during IEEE CNS 2017. v2: Fixed typos and extended literature section in accordance with reviewers' recommendations