#### Filter Results:

#### Publication Year

2007

2016

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

— In this paper we study the nested (degraded) message set problem, where user i ∈ {1,. .. , K} requires messages W1,. .. , Wi. We study this for a MIMO linear deterministic broadcast channel model, which is motivated by some recent successes in using such models to obtain insights into approximate characterizations for the Gaussian relay and interference… (More)

- Vinod Prabhakaran, Panganamala Ramana Kumar
- 2009 IEEE International Symposium on Information…
- 2009

In many low-power networks, the power cost for a node to remain ON to listen to transmissions from other nodes or to transmit to other nodes can constitute a significant part of the total power consumption by the radio. Thus, unlike the traditional relay channel model, under a low power constraint, the relay node cannot stay ON and listen to the entire… (More)

- Sundara Rajan S, Shijin Rajakrishnan, Andrew Thangaraj, Vinod Prabhakaran
- 2016 IEEE International Symposium on Information…
- 2016

The problem of three-party secure computation, where a function of private data of two parties is to be computed by a third party without revealing information beyond respective inputs or outputs is considered. New and better lower bounds on the amount of communication required between the parties to guarantee zero probability of error in the computation… (More)

In this paper, we introduce the notion of Plausible Deniability in an information theoretic framework. We consider a scenario where an entity that eavesdrops through a broadcast channel summons one of the parties in a communication protocol to reveal their message (or signal vector). It is desirable that the summoned party have the option to reveal as… (More)

- Shijin Rajakrishnan, Sundara Rajan S, Vinod Prabhakaran
- ArXiv
- 2016

—The question of how much communication is required between collaborating parties to compute a function of their data is of fundamental importance in the fields of theoretical computer science and information theory. In this work, the focus is on coming up with lower bounds on this. The information cost of a protocol is the amount of information the… (More)

research interests are in information theory, wireless communication, cryptography, distributed signal processing and communication. My research is in the area of information theory and in particular in its applications to communication and cryptography. Information theory originated as a mathematical formulation of the problem of communicating a source… (More)

We consider the two message set problem, where a source broadcasts a common message W 1 to an arbitrary set of receivers U and a private message W 2 to a subset of the receivers P ⊆ U. Transmissions occur over linear deterministic channels. For the case where at most two receivers do not require the private message, we give an exact characterization of the… (More)

In lectures 3 and 4 we encountered the Gaussian and polynomial kernels. In this lecture we will learn a few other examples of widely used kernels.

- ‹
- 1
- ›