activity
20082026
most citedOn network coding for sum-networks

72 citations · 158 across the 35 of their papers we have counts for

collaborators

49 papers

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.IT2025

Sequential Adversarial Hypothesis Testing

Eeshan Modak, Mayank Bakshi, Bikash Kumar Dey +1

We study the adversarial binary hypothesis testing problem in the sequential setting. Associated with each hypothesis is a closed, convex set of distributions. Given the hypothesis…

cs.IT2025

Sliding Window Adversarial Channels

Bikash Kumar Dey, Sidharth Jaggi, Michael Langberg +2

In an arbitrarily varying channel (AVC), the channel has a state which is under the control of an adversarial jammer and the corresponding capacities are often functions of the "po…

cs.IT2024

Identification Over Noisy Permutation Channels

Abhishek Sarkar, Bikash Kumar Dey

We study message identification over the noisy permutation channel. For discrete memoryless channels (DMCs), the number of identifiable messages grows doubly exponentially, and the…

cs.IT2024

Identification over Permutation Channels

Abhishek Sarkar, Bikash Kumar Dey

We study message identification over a q-ary uniform permutation channel, where the transmitted vector is permuted by a permutation chosen uniformly at random. For discrete memoryl…

cs.IT2023

Byzantine Multiple Access Channels -- Part II: Communication With Adversary Identification

Neha Sangwan, Mayank Bakshi, Bikash Kumar Dey +1

We introduce the problem of determining the identity of a byzantine user (internal adversary) in a communication system. We consider a two-user discrete memoryless multiple access…