— We investigate source coding in a cascade communication system consisting of an encoder, a relay and an end terminal, where both the relay and the end terminal wish to reconstruct source X with certain fidelities. Additionally, side-informations Z and Y are available at the relay and the end terminal, respectively. The side-information Z at the relay is a… (More)
– We consider the binary consensus problem where each node in the network initially observes one of two states and the goal for each node is to eventually decide which one of the two states was initially held by the majority of the nodes. Each node contacts other nodes and updates its current state based on the state communicated by the last contacted node.… (More)
We consider source coding over Aref networks. In particular we consider the following two problems: (i) multicasting correlated sources to a set of receivers, (ii) broadcasting sources to their respective receivers. For the first problem we show necessary and sufficient conditions for reliable multicast. For the second problem we show sufficient conditions… (More)
We present inner bounds to the broadcast capacity region of two classes of information networks: Networks of Multiple Access Channels (MACs) and Networks of Deterministic Broadcast Channels (DBCs). Our achievability scheme is a separation based scheme consisting of a physical layer that involves “cleaning up” the constituent channels in the… (More)
This paper provides an inner bound to the rate- distortion region of a source coding setup in which two encoders are allowed some collaboration to describe a pair of discrete memoryless sources. We further require some robustness in case one of the encoders breaks down. This is modeled by having a second decoder, observing the messages from only one of the… (More)
— Consider a network of nodes where each node has a message to communicate to all other nodes. For this communication problem, we analyze a gossip based protocol where coded messages are exchanged. This problem was studied in  where a bound to the dissemination time based on the spectral properties of the underlying communication graph is provided. Our… (More)
We define the “reordering channel” which approximates packet communication over multipath networks. We consider deterministic packet arrivals with finite horizon decoding of individual packets and analyze the error probability for a two stage coding scheme.
We study packet streaming over an erasure channel with delayed feedback. We consider the lag in playback between the sender and the receiver as the performance criterion and propose and analyze schemes to minimize the lag. We show that at lower delays in feedback, purely retransmission based schemes are better than random linear coding schemes and also… (More)
We consider the following communication problem over a directed graph. A source node wants to transmit a common message to a set of receiver nodes along with a private message to each of the receivers. We show a class of networks for which the achievable rate region is given by the cut-set bounds.
We examine routing over two classes of orthogonal information networks. The first is a relay network with orthogonal inputs. The nodes in this network do not broadcast, but communicate to the different nodes via independent inputs. There is multiple access interference at every node. The second network is the Gaussian broadcast network with no interference.… (More)