MAC Resolvability: First And Second Order Results
classification
💻 cs.IT
math.IT
keywords
resolvabilitychannelorderresultssecrecyachievableapproachbuilding
read the original 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.
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.