TY - JOUR AB - This paper shows that the logarithm of the ?-error capacity (average error probability) for n uses of a discrete memoryless channel (DMC) is upper bounded by the normal approximation plus a third-order term that does not exceed 1/2log n +O(1) if the ?-dispersion of the channel is positive. This matches a lower bound by Y. Polyanskiy (2010) for DMCs with positive reverse dispersion. If the ?-dispersion vanishes, the logarithm of the ?-dispersion capacity is upper bounded by n times the capacity plus a constant term except for a small class of DMCs and ??1/2. © 1963-2012 IEEE. AU - Tomamichel, M AU - Tan, VYF DA - 2013/11/04 DO - 10.1109/TIT.2013.2276077 EP - 7051 JO - IEEE Transactions on Information Theory PY - 2013/11/04 SP - 7041 TI - A tight upper bound for the third-order asymptotics for most discrete memoryless channels VL - 59 Y1 - 2013/11/04 Y2 - 2024/03/29 ER -