相关论文: Zero-error communication over networks

We study common randomness generation problems where $n$ players aim to generate same sequences of random coin flips where some subsets of the players share an independent common coin which can be tossed multiple times, and there is a…

We theoretically introduce and experimentally demonstrate the realization of a nonclassicality test that allows for arbitrarily low detection efficiency without invoking any extra assumptions as independence of the devices. Our test and its…

We study the possible difference between the quantum and the private capacities of a quantum channel in the zero-error setting. For a family of channels introduced by arXiv:1312.4989, we demonstrate an extreme difference: the zero-error…

We consider the task of remote state estimation and stabilization of disturbed linear plants via noisy communication channels. In 2007 Matveev and Savkin established a surprising link between this problem and Shannon's theory of zero-error…

Given the possibility of communication systems failing catastrophically, we investigate limits to communicating over channels that fail at random times. These channels are finite-state semi-Markov channels. We show that communication with…

This paper proposes a game-theoretic approach to address the problem of optimal sensor placement against an adversary in uncertain networked control systems. The problem is formulated as a zero-sum game with two players, namely a malicious…

This work considers the secure and reliable information transmission in two-hop relay wireless networks without the information of both eavesdropper channels and locations. While the previous work on this problem mainly studied infinite…

Anonymity is a fundamental cryptographic primitive that hides the identities of both senders and receivers during message transmission over a network. Classical protocols cannot provide information-theoretic security for such task, and…

A completely depolarising quantum channel always outputs a fully mixed state and thus cannot transmit any information. In a recent Letter [D. Ebler et al., Phys. Rev. Lett. 120, 120502 (2018)], it was however shown that if a quantum state…

We analyse a communication scenario over a particular causal broadcast channel whose state depends on a modulo sum. The receivers of the broadcast receive channel state information and collaborate to determine the channel state as to decode…

We consider a basic communication and sensing setup comprising a transmitter, a receiver and a sensor. The transmitter sends an encoded sequence to the receiver through a discrete memoryless channel, and the receiver is interested in…

By exploiting a generalization of recent results on environment-assisted channel correction, we show that, whenever a quantum system undergoes a channel realized as an interaction with a probe, the more efficiently the information about the…

Standard rational expectations models with an occasionally binding zero lower bound constraint either admit no solutions (incoherence) or multiple solutions (incompleteness). This paper shows that deviations from full-information rational…

Operating vehicles in adversarial environments between a recurring origin-destination pair requires new planning techniques. A two players zero-sum game is introduced. The goal of the first player is to minimize the expected casualties…

We consider a wireless channel shared by multiple transmitter-receiver pairs. Their transmissions interfere with each other. Each transmitter-receiver pair aims to maximize its long-term average transmission rate subject to an average power…

Emergent communication offers insight into how agents develop shared structured representations, yet most research assumes homogeneous modalities or aligned representational spaces, overlooking the perceptual heterogeneity of real-world…

We consider the problem of communicating over a channel for which no mathematical model is specified. We present achievable rates as a function of the channel input and output known a-posteriori for discrete and continuous channels, as well…

We introduce two methods for improving the performance of agents meeting for the first time to accomplish a communicative task. The methods are: (1) `message mutation' during the generation of the communication protocol; and (2) random…

One major function of social networks (e.g., massive online social networks) is the dissemination of information such as scientific knowledge, news, and rumors. Information can be propagated by the users of the network via natural…

Mertens [In Proceedings of the International Congress of Mathematicians (Berkeley, Calif., 1986) (1987) 1528-1577 Amer. Math. Soc.] proposed two general conjectures about repeated games: the first one is that, in any two-person zero-sum…