$(\epsilon, n)$ Fixed-Length Strong Coordination Capacity - Archive ouverte HAL
Communication Dans Un Congrès Année : 2021

$(\epsilon, n)$ Fixed-Length Strong Coordination Capacity

Résumé

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 $\epsilon$, 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} \left(\epsilon \right) \sqrt{ V/n}$, where $V$ is the channel dispersion, and $Q^{-1}$ is the inverse of the Gaussian cumulative distribution function.

Dates et versions

hal-03114677 , version 1 (19-01-2021)

Identifiants

Citer

Giulia Cervia, Tobias Oechtering, Mikael Skoglund. $(\epsilon, n)$ Fixed-Length Strong Coordination Capacity. 2021 IEEE Information Theory Workshop (ITW), Oct 2021, Kanazawa, Japan. pp.1-6, ⟨10.1109/ITW48936.2021.9611461⟩. ⟨hal-03114677⟩
15 Consultations
0 Téléchargements

Altmetric

Partager

More