6 papers · 1 filter
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…
Hypothesis Testing for Adversarial Channels: Chernoff-Stein Exponents
Eeshan Modak, Neha Sangwan, Mayank Bakshi +2
We study the Chernoff-Stein exponent of the following binary hypothesis testing problem: Associated with each hypothesis is a set of channels. A transmitter, without knowledge of t…
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…
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…
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…
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…