(ε, n) Fixed-Length Strong Coordination Capacity

01/18/2021
by   Giulia Cervia, et al.
0

This paper investigates the problem of synthesizing joint distributions in the finite-length regime. For a fixed blocklength n and an upper bound on the distribution approximation ϵ, we prove a capacity result for fixed-length strong coordination. It is shown analytically that the rate conditions for the fixed-length regime are lower-bounded by the mutual information that appears in the asymptotical condition plus Q^-1(ϵ) √( V/n), where V is the channel dispersion, and Q^-1 is the inverse of the Gaussian cumulative distribution function.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/27/2019

Fixed-Length Strong Coordination

We consider the problem of synthesizing joint distributions of signals a...
research
12/04/2018

A Tight Upper Bound on Mutual Information

We derive a tight lower bound on equivocation (conditional entropy), or ...
research
04/03/2020

A Single-Letter Upper Bound to the Mismatch Capacity

We derive a single-letter upper bound to the mismatched-decoding capacit...
research
05/11/2023

Improved Upper and Lower Bounds on the Capacity of the Binary Deletion Channel

The binary deletion channel with deletion probability d (BDC_d) is a ran...
research
02/09/2023

Mathematical Model of Quantum Channel Capacity

In this article, we are proposing a closed-form solution for the capacit...
research
12/01/2014

Understanding confounding effects in linguistic coordination: an information-theoretic approach

We suggest an information-theoretic approach for measuring stylistic coo...
research
10/31/2021

Capacity for Electromagnetic Information Theory

Traditional channel capacity based on one-dimensional time domain mismat...

Please sign up or login with your details

Forgot password? Click here to reset