Strong Converse and Second-Order Asymptotics of Channel Resolvability
arXiv:1404.5507
Abstract
We study the problem of channel resolvability for fixed i.i.d. input distributions and discrete memoryless channels (DMCs), and derive the strong converse theorem for any DMCs that are not necessarily full rank. We also derive the optimal second-order rate under a condition. Furthermore, under the condition that a DMC has the unique capacity achieving input distribution, we derive the optimal second-order rate of channel resolvability for the worst input distribution.
arXiv comment7 pages, a shorter version will appear in ISIT 2014, this version includes the proofs of technical lemmas in appendices
References in corpus (5)
- Information Spectrum Approach to Second-Order Coding Rate in Channel Coding
- Distributed Channel Synthesis
- An Information-Spectrum Approach to Classical and Quantum Hypothesis Testing for Simple Hypotheses
- Compression of sources of probability distributions and density operators
- Non-Asymptotic and Second-Order Achievability Bounds for Coding With Side-Information