Semi-Finite Length Analysis for Information Theoretic Tasks
arXiv:1811.00262
Abstract
We focus on the optimal value for various information-theoretical tasks. There are several studies for the asymptotic expansion for these optimal values up to the order or . However, these expansions have errors of the order or , which does not goes to zero asymptotically. To resolve this problem, we derive the asymptotic expansion up to the constant order for upper and lower bounds of these optimal values. While the expansions of upper and lower bonds do not match, they clarify the ranges of these optimal values, whose errors go to zero asymptotically.
References in corpus (7)
- Unconditional Security Of Quantum Key Distribution Over Arbitrarily Long Distances
- Information Spectrum Approach to Second-Order Coding Rate in Channel Coding
- Duality Between Smooth Min- and Max-Entropies
- Uniform Random Number Generation from Markov Chains: Non-Asymptotic and Asymptotic Analyses
- Tight asymptotic bounds on local hypothesis testing between a pure bipartite state and the white noise state
- Finite-Length Analyses for Source and Channel Coding on Markov Chains
- Asymptotic Compatibility between LOCC Conversion and Recovery