A tight upper bound for the third-order asymptotics of discrete memoryless channels
- Publication Type:
- Conference Proceeding
- IEEE International Symposium on Information Theory - Proceedings, 2013, pp. 1536 - 1540
- Issue Date:
Copyright Clearance Process
- Recently Added
- In Progress
- Closed Access
This item is closed access and not available.
This paper shows that the logarithm of the ε-error capacity (average error probability) for n uses of a discrete memoryless channel with positive conditional information variance at every capacity-achieving input distribution is upper bounded by the normal approximation plus a term that does not exceed 1/2 log n + O(1). © 2013 IEEE.
Please use this identifier to cite or link to this item: