We develop a low-complexity polar coding scheme for the discrete memoryless broadcast
channel with confidential messages under strong secrecy and randomness constraints. Our …

We consider strongly secure communication over a discrete memoryless multiple access
wiretap channel with two transmitters. No degradation or symmetry assumptions are made …

This paper investigates the problem of coordinating several agents through their actions,
focusing on an asymmetric observation structure with two agents. Specifically, one agent …

We show how to replace some of the randomized decisions in the encoding and decoding of
polar codes by deterministic decisions. Specifically, we prove that random decisions on low …

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 …

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 …

In a decentralized and self-configuring network, the communication devices are considered
as autonomous decision makers that sense their environment and that implement optimal …

We consider a network of two nodes separated by a noisy channel with two-sided state
information, in which the input and output signals have to be coordinated with the source …

We consider polar subcodes (PSCs), which are polar codes (PCs) with dynamically-frozen
symbols, to increase the minimum distance as compared to corresponding PCs. A …

In this paper, we consider the problem of polar coding for secure communications over the
two-way wiretap channel, where two legitimate users communicate with each other …