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

04/09/2019
by   Yasutada Oohama, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/09/2018

Improved Capacity Upper Bounds for the Discrete-Time Poisson Channel

We present new capacity upper bounds for the discrete-time Poisson chann...
research
11/05/2019

Computable Upper Bounds on the Capacity of Finite-State Channels

The capacity of finite-state channels (FSCs) without feedback is investi...
research
03/24/2020

Bounded state Estimation over Finite-State Channels: Relating Topological Entropy and Zero-Error Capacity

We investigate bounded state estimation of linear systems over finite-st...
research
09/03/2018

Delocalisation of one-dimensional marginals of product measures and the capacity of LTI discrete channels

We consider discrete linear time invariant (LTI) channels satisfying the...
research
06/16/2018

Sharp Analytical Capacity Upper Bounds for Sticky and Related Channels

We study natural examples of binary channels with synchronization errors...
research
05/13/2022

Data-Driven Upper Bounds on Channel Capacity

We consider the problem of estimating an upper bound on the capacity of ...
research
03/16/2022

New Converse Bounds on the Mismatched Reliability Function and the Mismatch Capacity Using an Auxiliary Genie Receiver

We develop a novel framework for proving converse theorems for channel c...

Please sign up or login with your details

Forgot password? Click here to reset