2000 character limit reached
MAC Resolvability: First And Second Order Results (1707.04156v2)
Published 13 Jul 2017 in cs.IT and 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.