English
Related papers

Related papers: Zero-error communication over networks

200 papers

We initiate the study of Bayesian conversations, which model interactive communication between two strategic agents without a mediator. We compare this to communication through a mediator and investigate the settings in which a mediation…

Computer Science and Game Theory · Computer Science 2025-07-16 Renato Paes Leme , Jon Schneider , Heyang Shang , Shuran Zheng

For the information transmission a binary symmetric channel is used. There is also another noisy binary symmetric channel (feedback channel), and the transmitter observes without delay all the outputs of the forward channel via that…

Information Theory · Computer Science 2008-08-18 Marat V. Burnashev , Hirosuke Yamamoto

This paper investigates reliable and covert transmission strategies in a multiple-input multiple-output (MIMO) wiretap channel with a transmitter, receiver and an adversarial wiretapper, each equipped with multiple antennas. In a departure…

Information Theory · Computer Science 2016-11-15 Amitav Mukherjee , A. Lee Swindlehurst

Consider a star network where each local node possesses a set of test statistics that exhibit a symmetric distribution around zero when their corresponding null hypothesis is true. This paper investigates statistical inference problems in…

Methodology · Statistics 2023-11-29 Mehrdad Pournaderi , Yu Xiang

The cognitive interference channel with confidential messages is studied. Similarly to the classical two-user interference channel, the cognitive interference channel consists of two transmitters whose signals interfere at the two…

Information Theory · Computer Science 2007-10-11 Yingbin Liang , Anelia Somekh-Baruch , H. Vincent Poor , Shlomo Shamai , Sergio Verdu

Zero-determinant strategies are a class of strategies in repeated games which unilaterally control payoffs. Zero-determinant strategies have attracted much attention in studies of social dilemma, particularly in the context of evolution of…

Statistical Mechanics · Physics 2024-11-11 Masahiko Ueda

In cognitive radio networks, when secondary users transmit in the null space of their interference channel with primary user, they can avoid interference. However, performance of this scheme depends on knowledge of channel state information…

Information Theory · Computer Science 2015-04-14 Shabnam Sodagari

We consider two-player games with imperfect information and the synthesis of a randomized strategy for one player that ensures the objective is satisfied almost-surely (i.e., with probability 1), regardless of the strategy of the other…

Computer Science and Game Theory · Computer Science 2024-07-30 Laurent Doyen , Thomas Soullard

This paper investigates the role that null messages play in synchronous systems with and without failures, and provides necessary and sufficient conditions on the structure of protocols for information transfer and coordination there. We…

Distributed, Parallel, and Cluster Computing · Computer Science 2023-08-09 Raïssa Nataf , Guy Goren , Yoram Moses

Communication games are collaborative information processing tasks involving a number of players with limited communication. Such games are useful tools for studying physical theories. A physical theory exhibits preparation contextuality…

Quantum Physics · Physics 2017-05-15 Armin Tavakoli

Covert communications enable a transmitter to send information reliably in the presence of an adversary, who looks to detect whether the transmission took place or not. We consider covert communications over quasi-static block fading…

Information Theory · Computer Science 2020-09-29 Khurram Shahzad , Xiangyun Zhou

We study the problem of securely estimating the states of an unstable dynamical system subject to nonstochastic disturbances. The estimator obtains all its information through an uncertain channel which is subject to nonstochastic…

Consider communication over a channel whose probabilistic model is completely unknown vector-wise and is not assumed to be stationary. Communication over such channels is challenging because knowing the past does not indicate anything about…

Information Theory · Computer Science 2013-03-21 Yuval Lomnitz , Meir Feder

We determine the optimal achievable rate at which entanglement can be reliably transmitted when the memoryless channel used during transmission is unknown both to sender and receiver. To be more precise, we assume that both of them only…

Quantum Physics · Physics 2009-04-21 Igor Bjelakovic , Holger Boche , Janis Noetzel

This paper presents new methods enabling anonymous communication on the Internet. We describe a new protocol that allows us to create an anonymous overlay network by exploiting the web browsing activities of regular users. We show that the…

Cryptography and Security · Computer Science 2007-05-23 Matthias Bauer

Transmitting data reliably over noisy communication channels is one of the most important applications of information theory, and well understood when the channel is accurately modelled by classical physics. However, when quantum effects…

The Principle of Maximum Entropy is a rigorous technique for estimating an unknown distribution given partial information while simultaneously minimizing bias. However, an important requirement for applying the principle is that the…

Information Theory · Computer Science 2026-02-03 Kenneth Bogert , Matthew Kothe

Meta-training agents with memory has been shown to culminate in Bayes-optimal agents, which casts Bayes-optimality as the implicit solution to a numerical optimization problem rather than an explicit modeling assumption. Bayes-optimal…

Several communication models that are of relevance in practice are asymmetric in the way they act on the transmitted "objects". Examples include channels in which the amplitudes of the transmitted pulses can only be decreased, channels in…

Information Theory · Computer Science 2022-12-29 Mladen Kovačević , Dejan Vukobratović

This letter studies information-theoretic security without knowing the eavesdropper's channel fading state. We present an alternative secrecy outage formulation to measure the probability that message transmissions fail to achieve perfect…

Information Theory · Computer Science 2016-11-17 Xiangyun Zhou , Matthew R. McKay , Behrouz Maham , Are Hjorungnes