Bikash Kumar Dey

Bikash Kumar Dey

Auto-generated profile, based on publicly available information

Bikash Kumar Dey

Department of Electrical Engineering, Indian Institute of Technology Bombay, Mumbai, India

Research Focus & Metrics

Academic Career Length

21Years (2006-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
14 May 2019 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
BDBikash Kumar Dey
Bikash Kumar Dey
SJSidharth Jaggi
Sidharth Jaggi
MLMichael Langberg
Michael Langberg
We consider a communication problem in which a sender, Alice, wishes to communicate with a receiver, Bob, over a channel controlled by an adversarial jammer, James, who is myopic. Specifically, for blocklength n, the codeword Xn transmitted by Alice is corrupted by James who must base his adversarial decisions (of which locations of Xn to corrupt and how to corrupt them) on the non-causal observation Zn of Xn obtained through a noisy memoryless channel. More specifically, our communication model may be described by two channels. A memoryless channel pZjX from Alice to James, and an Arbitrarily Varying Channel from Alice to Bob, pY jXS governed by a state Sn determined by James. In standard adversarial channels the states Sn may depend on the codeword Xn, but in our setting Sn depends non-causally only on James’s view Zn. We present upper and lower bounds on the capacity of myopic channels. For a number of special cases of interest we show that our bounds are tight. We then extend our results to the setting of secure communication, in which we require that the transmitted message remains secret from James. For example, we show that if (i) James may flip at most a p fraction of the bits communicated between Alice and Bob, and (ii) James views Xn through a binary symmetric channel with crossover probability q, then once James is “sufficiently myopic” (in this case, when p < 0:5 and H(q) > H(p)), then the optimal communication rate is that of an adversary who is “blind” (that is, an adversary that does not have any knowledge of Xn at all), which is 1.. H(p) for standard communication, and H(q)..H(p) for secure communication. A similar phenomenon exists for more general models of communication.

9 February 2022 in IEEE Transactions on Information Theory
Verified
Journal Article
Open access
CGChinmay Gurjarpadhye
Chinmay Gurjarpadhye
JRJithin Ravi
Jithin Ravi
SKSneha Kamath
Sneha Kamath
BDBikash Kumar Dey
Bikash Kumar Dey
NKNikhil Karamchandani
Nikhil Karamchandani
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 non-private scheme that serves only a subset of the demands for the $N$ files and $NK$ users problem. We further use this fact to construct a demand-private scheme for $N$ files and $K$ users from a particular known non-private scheme for $N$ files and $NK-K+1$ users. It is then demonstrated that, the memory-rate pair $(M,\min \{N,K\}(1-M/N))$ , which is achievable for non-private schemes with uncoded transmissions, is also achievable under demand privacy. We further propose a scheme that improves on these ideas by removing some redundant transmissions. The memory-rate trade-off achieved using our schemes is shown to be within a multiplicative factor of 3 from the optimal when $K < N$ and of 8 when $N \leq K$ . Finally, we give the exact memory-rate trade-off for demand-private coded caching problems with $N\geq K=2$ .

1 January 2008
Verified
Conference Paper
Closed access
SSS. Shintre
S. Shintre
SKS. Katti
S. Katti
SJS. Jaggi
S. Jaggi
BDB. K. Dey
B. K. Dey
DKD. Katabi
D. Katabi
MMM. Medard
M. Medard
As an alternative to the algebraic network codes prevalent in the literature, we consider Arithmetic Network Codes (henceforth abbreviated as ANCs), i.e., codes in which interior nodes perform finite precision arithmetic over the real or complex fields. We suggest two applications where using such codes can be advantageous. First, we demonstrate that the multi-resolution behaviour of ANCs potentially outperforms that of algebraic network codes. Second, the interfering and fading nature of wireless channels naturally results in complex linear combinations of transmissions, analogous to ANCs. We then characterize the multicast rates achievable by ANCs, and demonstrate that for high precision arithmetic these are equivalent to those obtained by algebraic network codes. We show the connection between the performance of ANCs and the numerical conditioning of network transform matrices. Using this, we obtain upper and lower bounds on the number of significant bits required to perform the finite precision arithmetic in terms of the network parameters. We compare this with simulation results for randomized and deterministic design of ANCs.

1 December 2006
Verified
Conference Paper
Closed access
BJBhushan G. Jagyasi
Bhushan G. Jagyasi
BDBikash K. Dey
Bikash K. Dey
SMS. N. Merchant
S. N. Merchant
UDU. B. Desai
U. B. Desai
We consider design of wireless sensor network for event detection application. An MMSE based q-bit weighted aggregation scheme (q-WAS) is proposed in which each node transmits q bits to its parent in every session. The observation of each sensor is assumed to be one bit. The simulation results show that 1-WAS achieves better accuracy than a previously proposed one bit aggregation scheme while offering almost same lifetime. With increasing q, the accuracy of q-WAS approaches that of the infinite precision aggregation scheme. Moreover, the lifetime for q-WAS is significantly higher than infinite precision aggregation scheme. For a 100 node sensor network, the simulation results show that 3-WAS achieves a near optimum accuracy. The lifetime of the q-WAS is approximately 1/q-th of the lifetime of the one bit aggregation schemes. Hence this class of aggregation schemes offers a trade-off between accuracy and lifetime.

12 December 2023 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
NSNeha Sangwan
Neha Sangwan
MBMayank Bakshi
Mayank Bakshi
BDBikash Kumar Dey
Bikash Kumar Dey
VPVinod M. Prabhakaran
Vinod M. Prabhakaran
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 reliably. When a user behaves adversarially, we require that the honest users’ messages be decoded reliably. An adversarial user can mount an attack by sending any input into the channel rather than following the protocol. It turns out that the 2-user MAC capacity region follows from the point-to-point Arbitrarily Varying Channel (AVC) capacity. For the 3-user MAC in which at most one user may be malicious, we characterize the capacity region for deterministic codes and randomized codes (where each user shares an independent random secret key with the receiver). These results are then generalized for the k -user MAC where the adversary may control all users in one out of a collection of given subsets.

27 September 2024 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
NSNeha Sangwan
Neha Sangwan
MBMayank Bakshi
Mayank Bakshi
BDBikash Kumar Dey
Bikash Kumar Dey
VPVinod M. Prabhakaran
Vinod M. Prabhakaran
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. Since small deviations may be indistinguishable from the effects of channel noise, it might be overly restrictive to attempt to detect all deviations. In our formulation, we only require detecting deviations which impede the decoding of the non-deviating user’s message. When neither user deviates, correct decoding is required. When one user deviates, the decoder must either output a pair of messages of which the message of the non-deviating user is correct or identify the deviating user. The users and the receiver do not share any randomness. The results include a characterization of the set of channels where communication is feasible, and an inner and outer bound on the capacity region. We also show that whenever the rate region has non-empty interior, the capacity region is same as the capacity region under randomized encoding, where each user shares independent randomness with the receiver. We also give an outer bound for this randomized coding capacity region.