activity
20082026
most citedByzantine Multiple Access

5 citations · 10 across the 22 of their papers we have counts for

collaborators
Showing 2026Show all

5 papers · 1 filter

cs.IT2026

Authentication over Arbitrarily Varying Channels with Causal Adversaries

Mayank Bakshi, Vinod M. Prabhakaran, Bikash Kumar Dey +1

We study authentication over a discrete memoryless arbitrarily varying channel (AVC) in which the adversary selects the channel state causally based on past channel outputs. We pro…

cs.IT2026

Secure Distributed Hypothesis Testing

Gowtham R. Kurri, Varun Narayanan, Vinod M. Prabhakaran +1

In distributed hypothesis testing, a central server performs hypothesis testing based on information received from distributed sensors/clients. We study a secure variant of this pr…

cs.IT2026

Memory Constrained Adversarial Hypothesis Testing

Malhar A. Managoli, Vinod M. Prabhakaran

We study adversarial binary hypothesis testing under memory constraints. The test is a time-invariant randomized finite state machine (FSM) with S states. Associated with each hypo…

cs.IT2026

From Submodularity to Matrix Determinants: Strengthening Han's, Szász's, and Fischer's Inequalities

Gunank Jakhar, Gowtham R. Kurri, Suryajith Chillara +1

Dembo, Cover, and Thomas (1991) developed an elegant information-theoretic framework for proving determinantal inequalities for positive definite matrices, which relies on the stru…

cs.IT2026

Generalized Information Inequalities via Submodularity, and Two Combinatorial Problems

Gunank Jakhar, Gowtham R. Kurri, Suryajith Chillara +1

It is well known that there is a strong connection between entropy inequalities and submodularity, since the entropy of a collection of random variables is a submodular function. U…