New Converse Bounds for Discrete Memoryless Channels in the Finite Blocklength Regime

2019/04/09 by Oohama, Yasutada
#FOS: Computer and information sciences #Information Theory (cs.IT)

paper · doi:10.48550/arxiv.1904.04894

Abstract

We study the determination problem of the channel capacity for the discrete memoryless channels in the finite blocklength regime. We derive explicit lower and upper bounds of the capacity. We shall demonstrate that the information spectrum approach is quite useful for investigating this problem.

Related

• A Simple Technique for the Converse of Finite Blocklength Multiple Access Channels
• On Dispersions of Discrete Memoryless Channels with Noncausal State Information at the Encoder
• Generalized Bounds on the Capacity of the Binary-Input Channels
• On Bounds and Closed Form Expressions for Capacities of Discrete\n Memoryless Channels with Invertible Positive Matrices
• Capacity of Block-Memoryless Channels with Causal Channel Side Information