Vinod M. Prabhakaran

Learn More
—When it is desired to transmit redundant data over an insecure and bandwidth-constrained channel, it is customary to first compress the data and then encrypt it. In this paper, we investigate the novelty of reversing the order of these steps, i.e., first encrypting and then compressing, without compromising either the compression efficiency or the(More)
In this correspondence, we consider the problem of constructing an erasure code for storage over a network when the data sources are distributed. Specifically, we assume that there are <i>n</i> storage nodes with limited memory and <i>k</i> &lt; <i>n</i> sources generating the data. We want a data collector, who can appear anywhere in the network, to query(More)
Interference is a fundamental feature of the wireless channel. Cooperation among the radios has been shown to manage interference in a multiple unicast wireless network in a near optimal scaling law sense [4]. In this paper, we study the two user Gaussian interference channel where the source nodes can both talk and listen. Focusing on the full-duplex mode(More)
We introduce the two user finite state compound Gaussian interference channel and characterize its capacity region to within one bit. The main contributions involve both novel inner and outer bounds. The inner bound is multilevel super-position coding but the decoding of the levels is opportunistic, depending on the channel state. The genie aided outer(More)
—We investigate secure multi-party sampling problems involving more than two parties. In the public discussion model, we give a simple characterization of the distributions that can be sampled without any setup. In a model which allows private point-to-point communication, we reduce the problem of characterizing distributions that can be securely sampled(More)