Semi-Finite Length Analysis for Information Theoretic Tasks
share
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 √(n) or n. However, these expansions have errors of the order o(√(n)) or o( n), 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.
READ FULL TEXT