activity
20052023
most citedThe Gelfand-Pinsker Channel: Strong Converse and Upper Bound for the Reliability Function

8 citations · 23 across the 11 of their papers we have counts for

collaborators

15 papers

cs.IT2023★ 3 cited

Shared Information for a Markov Chain on a Tree

Sagnik Bhattacharya, Prakash Narayan

Shared information is a measure of mutual dependence among multiple jointly distributed random variables with finite alphabets. For a Markov chain on a tree with a given joint dist…

cs.IT2023

List Privacy Under Function Recoverability

Ajaykrishnan Nageswaran, Prakash Narayan

For a given function of user data, a querier must recover with at least a prescribed probability, the value of the function based on a user-provided query response. Subject to this…

cs.IT2021

Distribution Privacy Under Function Recoverability

Ajaykrishnan Nageswaran, Prakash Narayan

A user generates n independent and identically distributed data random variables with a probability mass function that must be guarded from a querier. The querier must recover, wit…

cs.IT2018

Data Privacy for a -Recoverable Function

Ajaykrishnan Nageswaran, Prakash Narayan

A user's data is represented by a finite-valued random variable. Given a function of the data, a querier is required to recover, with at least a prescribed probability, the value o…

cs.IT2017

Universal Sampling Rate Distortion

Vinay Praneeth Boda, Prakash Narayan

We examine the coordinated and universal rate-efficient sampling of a subset of correlated discrete memoryless sources followed by lossy compression of the sampled sources. The goa…

cs.IT2016

Sampling Rate Distortion

Vinay Praneeth Boda, Prakash Narayan

Consider a discrete memoryless multiple source with components of which possibly different sources are sampled at each time instant and jointly compressed in order t…