Search Results - "Dey, Bikash Kumar"

On Network Coding for Sum-Networks by Rai, Brijesh Kumar, Dey, Bikash Kumar

“…A directed acyclic network is considered where all the terminals need to recover the sum of the symbols generated at all the sources. We call such a network a…”
Get full text

Upper Bounds on the Capacity of Binary Channels With Causal Adversaries by Dey, B. K., Jaggi, S., Langberg, M., Sarwate, A. D.

“…In this paper, we consider the communication of information in the presence of a causal adversarial jammer. In the setting under study, a sender wishes to…”
Get full text

An MMSE Strategy at Relays With Partial CSI for a Multi-Layer Relay Network by Elamvazhuthi, Pannir Selvam, Dey, Bikash Kumar, Bhashyam, Srikrishna

“…We consider a relay network with a single source-destination pair and multiple layers of relays between them. We assume that these layers sequentially relay…”
Get full text

Codes Against Online Adversaries: Large Alphabets by Dey, B. K., Jaggi, S., Langberg, M.

“…In this paper, we consider the communication of information in the presence of an online adversarial jammer. In the setting under study, a sender wishes to…”
Get full text

Estimating network link characteristics using packet-pair dispersion: A discrete-time queueing theoretic analysis by Dey, Bikash Kumar, Manjunath, D., Chakraborty, Supriyo

“…We present a queueing theoretic analysis of packet-dispersion based probing. The links are modeled as independent discrete-time queues with i.i.d. arrivals. We…”
Get full text

A Channel Coding Perspective of Collaborative Filtering by Aditya, S T, Dabeer, O, Dey, B K

“…We consider the problem of collaborative filtering from a channel coding perspective. We model the underlying rating matrix as a finite alphabet matrix with…”
Get full text

On existence of good self-dual quasi-cyclic codes by Dey, B.K.

“…For a long time, asymptotically good self-dual codes have been known to exist. Asymptotically good 2-quasicyclic codes of rate 1/2 have also been known to…”
Get full text

Sufficiently Myopic Adversaries Are Blind by Dey, Bikash Kumar, Jaggi, Sidharth, Langberg, Michael

“…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,…”
Get full text

Byzantine Multiple Access Channels - Part II: Communication With Adversary Identification by Sangwan, Neha, Bakshi, Mayank, Dey, Bikash Kumar, Prabhakaran, Vinod M.

“…We introduce the problem of determining the identity of a byzantine user (internal adversary) in a communication system. We consider a two-user discrete…”
Get full text

Function Computation Through a Bidirectional Relay by Ravi, Jithin, Dey, Bikash Kumar

“…We consider a function computation problem in a three-node wireless network. Nodes A and B observe two correlated sources <inline-formula> <tex-math…”
Get full text

Byzantine Multiple Access Channels-Part I: Reliable Communication by Sangwan, Neha, Bakshi, Mayank, Dey, Bikash Kumar, Prabhakaran, Vinod M.

“…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…”
Get full text

Fundamental Limits of Demand-Private Coded Caching by Gurjarpadhye, Chinmay, Ravi, Jithin, Kamath, Sneha, Dey, Bikash Kumar, Karamchandani, Nikhil

“…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…”
Get full text

The Interplay of Causality and Myopia in Adversarial Channel Models by Kumar Dey, Bikash, Jaggi, Sidharth, Langberg, Michael, Sarwate, Anand D., Wang, Carol

“…The difference in capacity formulae between worst-case and average-case channel noise models has been part of information theory since the early days of the…”
Get full text

Private Index Coding by 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…”
Get full text

Oblivious Transfer Over Wireless Channels by Ravi, Jithin, Dey, Bikash Kumar, Viterbo, Emanuele

“…We consider the problem of oblivious transfer (OT) over OFDM and MIMO wireless communication systems where only the receiver knows the channel state…”
Get full text

Communication in the Presence of a State-Aware Adversary by Budkuley, Amitalok J., Dey, Bikash Kumar, Prabhakaran, Vinod M.

“…We study communication systems over the state-dependent channels in the presence of a malicious state-aware jamming adversary. The channel has a memoryless…”
Get full text

Wiretapped Oblivious Transfer by Mishra, Manoj, Dey, Bikash Kumar, Prabhakaran, Vinod M., Diggavi, Suhas N.

“…In this paper, we study the problem of obtaining 1-of-2 string oblivious transfer (OT) between users Alice and Bob, in the presence of a passive eavesdropper…”
Get full text

Distributed Rate Adaptation and Power Control in Fading Multiple Access Channels by Sreekumar, Sreejith, Dey, Bikash Kumar, Pillai, Sibi Raj B.

“…Traditionally, the capacity region of a coherent fading multiple access channel (MAC) is analyzed in two popular contexts. In the first, a centralized system…”
Get full text

Network Flows for Function Computation by Shah, V., Dey, B. K., Manjunath, D.

“…We consider in-network computation of an arbitrary function over an arbitrary communication network. A network with capacity constraints on the links is given…”
Get full text

Identification over Permutation Channels by 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…”
Get full text