Zobrazeno 1 - 10
of 140
pro vyhledávání: '"Dey, Bikash Kumar"'
Autor:
Sarkar, Abhishek, Dey, Bikash Kumar
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 memoryless channels(DMCs), the number of identifiable messages grows doubly e
Externí odkaz:
http://arxiv.org/abs/2405.09309
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 channel where either user may deviate from the prescribed behaviour. S
Externí odkaz:
http://arxiv.org/abs/2309.11174
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 the hypothesis, chooses the vector of inputs to the channel. Given the
Externí odkaz:
http://arxiv.org/abs/2304.14166
We study communication over a Multiple Access Channel (MAC) where users can possibly be adversarial. The receiver is unaware of the identity of the adversarial users (if any). When all users are non-adversarial, we want their messages to be decoded r
Externí odkaz:
http://arxiv.org/abs/2211.12769
Autor:
Chaudhuri, Syomantak, Sangwan, Neha, Bakshi, Mayank, Dey, Bikash Kumar, Prabhakaran, Vinod M.
We propose a communication model, that we call compound arbitrarily varying channels (CAVC), which unifies and generalizes compound channels and arbitrarily varying channels (AVC). A CAVC can be viewed as a noisy channel with a fixed, but unknown, co
Externí odkaz:
http://arxiv.org/abs/2105.03420
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 channel where either user may deviate from the prescribed behaviour. O
Externí odkaz:
http://arxiv.org/abs/2105.03380
We consider the coded caching problem with an additional privacy constraint that a user should not get any information about the demands of the other users. We first show that a demand-private scheme for $N$ files and $K$ users can be obtained from a
Externí odkaz:
http://arxiv.org/abs/2101.07127
Autor:
Narayanan, Varun, Ravi, Jithin, Mishra, Vivek K., Dey, Bikash Kumar, Karamchandani, Nikhil, Prabhakaran, Vinod M.
We study the fundamental problem of index coding under an additional privacy constraint that requires each receiver to learn nothing more about the collection of messages beyond its demanded messages from the server and what is available to it as sid
Externí odkaz:
http://arxiv.org/abs/2006.00257
The distributed coded caching problem has been studied extensively in the recent past. While the known coded caching schemes achieve an improved transmission rate, they violate the privacy of the users since in these schemes the demand of one user is
Externí odkaz:
http://arxiv.org/abs/1911.06995
We study communication over multiple access channels (MAC) where one of the users is possibly adversarial. When all users are non-adversarial, we want their messages to be decoded reliably. When an adversary is present, we consider two different deco
Externí odkaz:
http://arxiv.org/abs/1904.11925