多址信道可解性：一阶与二阶结果
信息论
2018-01-15 v2 math.IT
摘要
基于先前关于保密性与信道可解性之间关系的工作，我们从可解性的角度重新审视了多址信道的保密性证明。然后我们改进该方法以获得关于二阶可达速率的一些新结果。
引用
@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}
}
备注
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