28,334 research outputs found
Strong Coordination with Polar Codes
In this paper, we design explicit codes for strong coordination in two-node
networks. Specifically, we consider a two-node network in which the action
imposed by nature is binary and uniform, and the action to coordinate is
obtained via a symmetric discrete memoryless channel. By observing that polar
codes are useful for channel resolvability over binary symmetric channels, we
prove that nested polar codes achieve a subset of the strong coordination
capacity region, and therefore provide a constructive and low complexity
solution for strong coordination.Comment: 7 pages doublespaced, presented at the 50th Annual Allerton
Conference on Communication, Control and Computing 201
Empirical and Strong Coordination via Soft Covering with Polar Codes
We design polar codes for empirical coordination and strong coordination in
two-node networks. Our constructions hinge on the fact that polar codes enable
explicit low-complexity schemes for soft covering. We leverage this property to
propose explicit and low-complexity coding schemes that achieve the capacity
regions of both empirical coordination and strong coordination for sequences of
actions taking value in an alphabet of prime cardinality. Our results improve
previously known polar coding schemes, which (i) were restricted to uniform
distributions and to actions obtained via binary symmetric channels for strong
coordination, (ii) required a non-negligible amount of common randomness for
empirical coordination, and (iii) assumed that the simulation of discrete
memoryless channels could be perfectly implemented. As a by-product of our
results, we obtain a polar coding scheme that achieves channel resolvability
for an arbitrary discrete memoryless channel whose input alphabet has prime
cardinality.Comment: 14 pages, two-column, 5 figures, accepted to IEEE Transactions on
Information Theor
Information Design for Strategic Coordination of Autonomous Devices with Non-Aligned Utilities
In this paper, we investigate the coordination of autonomous devices with
non-aligned utility functions. Both encoder and decoder are considered as
players, that choose the encoding and the decoding in order to maximize their
long-run utility functions. The topology of the point-to-point network under
investigation, suggests that the decoder implements a strategy, knowing in
advance the strategy of the encoder. We characterize the encoding and decoding
functions that form an equilibrium, by using empirical coordination. The
equilibrium solution is related to an auxiliary game in which both players
choose some conditional distributions in order to maximize their expected
utilities. This problem is closely related to the literature on "Information
Design" in Game Theory. We also characterize the set of posterior distributions
that are compatible with a rate-limited channel between the encoder and the
decoder. Finally, we provide an example of non-aligned utility functions
corresponding to parallel fading multiple access channels.Comment: IEEE Proc. of the Fifty-fourth Annual Allerton Conference Allerton
House, UIUC, Illinois, USA September 27 - 30, 201
Empirical Coordination with Channel Feedback and Strictly Causal or Causal Encoding
In multi-terminal networks, feedback increases the capacity region and helps
communication devices to coordinate. In this article, we deepen the
relationship between coordination and feedback by considering a point-to-point
scenario with an information source and a noisy channel. Empirical coordination
is achievable if the encoder and the decoder can implement sequences of symbols
that are jointly typical for a target probability distribution. We investigate
the impact of feedback when the encoder has strictly causal or causal
observation of the source symbols. For both cases, we characterize the optimal
information constraints and we show that feedback improves coordination
possibilities. Surprisingly, feedback also reduces the number of auxiliary
random variables and simplifies the information constraints. For empirical
coordination with strictly causal encoding and feedback, the information
constraint does not involve auxiliary random variable anymore.Comment: 5 pages, 6 figures, presented at IEEE International Symposium on
Information Theory (ISIT) 201
- …