Fixed-Length Strong Coordination
Giulia Cervia, Tobias Oechtering, and Mikael Skoglund

TL;DR
This paper proposes a coding scheme for finite-length channels that achieves joint distributions close to a target distribution, extending to asymptotic cases as blocklength increases.
Contribution
It introduces a method for synthesizing joint distributions over noisy channels at fixed blocklengths with explicit bounds on distribution accuracy.
Findings
Achieves $ ext{L}^1$-closeness to target distribution at finite blocklengths.
Characterizes the set of achievable distributions and rates for asymptotic strong coordination.
Provides a framework bridging finite-length and asymptotic coordination regimes.
Abstract
We consider the problem of synthesizing joint distributions of signals and actions over noisy channels in the finite-length regime. For a fixed blocklength and an upper bound on the distance , a coding scheme is proposed such that the induced joint distribution is -close in 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 that tends to infinity.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCellular Automata and Applications · DNA and Biological Computing · Wireless Communication Security Techniques
