Related papers: Strong Coordination over Noisy Channels: Is Separa…
With the increasing number of user equipment (UE) and data demands, denser access points (APs) are being employed. Resource allocation problems have been extensively researched with interference treated as noise. It is well understood that…
We consider the problem of making distributed computations robust to noise, in particular to worst-case (adversarial) corruptions of messages. We give a general distributed interactive coding scheme which simulates any asynchronous…
In crowded environments, individuals must navigate around other occupants to reach their destinations. Understanding and controlling traffic flows in these spaces is relevant for coordinating robot swarms and designing infrastructure for…
In this paper, we consider a network of processors aiming at cooperatively solving mixed-integer convex programs subject to uncertainty. Each node only knows a common cost function and its local uncertain constraint set. We propose a…
Due to the short and bursty incoming messages, channel access activities in a wireless random access system are often fractional. The lack of frequent data support consequently makes it difficult for the receiver to estimate and track the…
We consider the problem of error control in a coded, multicast network, focusing on the scenario where the errors can occur only on a proper subset of the network edges. We model this problem via an adversarial noise, presenting a formal…
Two remote agents with synchronized clocks may use them to act in concert and communicate. This necessitates some means of creating and maintaining synchrony. One method, not requiring any direct interaction between the agents, is to expose…
The secrecy performance of a source-channel model is studied in the context of lossy source compression over a noisy broadcast channel. The source is causally revealed to the eavesdropper during decoding. The fidelity of the transmission to…
Dynamics of many-qubit systems, that may correspond to computational processing with quantum systems, can be efficiently and generally approximated by a sequence of two- and single-qubit gates. In practical applications, however, a quantum…
We consider computations over networks with multiple broadcast channels that intersect at a single party. Each broadcast link suffers from random bit-flip noise that affects the receivers independently. We design interactive coding schemes…
We study the problem of joint optimization involving coding and control policies for a controlled Markovian sytem over a finite-rate noiseless communication channel. While structural results on the optimal encoding and control have been…
Most of the existing P2P content distribution schemes implement a random or rarest piece first dissemination procedure to avoid duplicate transmission of the same pieces of data and rare pieces of data occurring in the network. This problem…
We consider the problem of generating correlated random variables in a distributed fashion, where communication is constrained to a cascade network. The first node in the cascade observes an i.i.d. sequence $X^n$ locally before initiating…
We consider interactive coding in a setting where $n$ parties wish to compute a joint function of their inputs via an interactive protocol over imperfect channels. We assume that adversarial errors can comprise a $\mathcal{O}(\frac{1}{n})$…
Life relies on the efficient performance of molecular codes, which relate symbols and meanings via error-prone molecular recognition. We describe how optimizing a code to withstand the impact of molecular recognition noise may be…
One of the key open problems in network information theory is to obtain the capacity region for the two-user Interference Channel (IC). In this paper, new results are derived for this channel. As a first result, a noisy interference regime…
We develop elements of a theory of cooperation and coordination in networks. Rather than considering a communication network as a means of distributing information, or of reconstructing random processes at remote nodes, we ask what…
A discrete time stochastic feedback control system with a noisy communication channel between the sensor and the controller is considered. The sensor has limited memory. At each time, the sensor transmits encoded symbol over the channel and…
This work mainly addresses continuous-time multiagent consensus networks where an adverse attacker affects the convergence performances of said protocol. In particular, we develop a novel secure-by-design approach in which the presence of a…
We consider the problem of communication over a network containing a hidden and malicious adversary that can control a subset of network resources, and aims to disrupt communications. We focus on omniscient node-based adversaries, i.e., the…