Fixed-Length Strong Coordination

09/27/2019
by   Giulia Cervia, et al.
0

We consider the problem of synthesizing joint distributions of signals and actions over noisy channels in the finite-length regime. For a fixed blocklength n and an upper bound on the distance ε, a coding scheme is proposed such that the induced joint distribution is ε-close in L^1 distance to a target i.i.d. distribution. The set of achievable target distributions and rate for asymptotic strong coordination can be recovered from the main result of this paper by having n that tends to infinity.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/18/2021

(ε, n) Fixed-Length Strong Coordination Capacity

This paper investigates the problem of synthesizing joint distributions ...
research
10/27/2020

Impossibility of phylogeny reconstruction from k-mer counts

We consider phylogeny estimation under a two-state model of sequence evo...
research
09/14/2023

Simulation Study of the Upper-limb Wrench Feasible Set with Glenohumeral Joint Constraints

The aim of this work is to improve musculoskeletal-based models of the u...
research
08/15/2018

Strong Coordination over Noisy Channels

We study the problem of strong coordination of the actions of two nodes ...
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
07/15/2019

Empirical Coordination Subject to a Fidelity Criterion

We study the problem of empirical coordination subject to a fidelity cri...
research
09/03/2020

Secure Strong Coordination

We consider a network of two nodes separated by a noisy channel, in whic...

Please sign up or login with your details

Forgot password? Click here to reset