#### Filter Results:

#### Publication Year

2009

2016

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

—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)

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)

—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)

- Vinod Prabhakaran, Journal Papers, K V Prabhakaran, K Eswaran, Ramchandran, R V Prabhakaran +7 others
- 2014

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)

- S Saeedi, S Diggavi, C Fragouli, V Prabhakaran
- 2009

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
- ›