Name
Affiliation
Papers
BIKASH KUMAR DEY
Indian Inst Technol, Dept Elect Engn, Bombay, Maharashtra, India
61
Collaborators
Citations 
PageRank 
64
185
27.07
Referers 
Referees 
References 
259
556
473
Search Limit
100556
Title
Citations
PageRank
Year
Private Index Coding10.352022
Fundamental Limits of Demand-Private Coded Caching10.402022
Compound Arbitrarily Varying Channels00.342021
Demand-Private Coded Caching and the Exact Trade-off for N=K=200.342020
Symmetrizability for Myopic AVCs00.342020
The Interplay Of Causality And Myopia In Adversarial Channel Models00.342019
Multiple Access Channels with Byzantine Users10.352019
Byzantine Multiple Access.00.342019
Multiple Access Channels with Adversarial Users10.372019
Arbitrarily Varying Remote Sources.00.342018
Quadratically Constrained Channels With Causal Adversaries00.342018
On the Rate Distortion Function of Arbitrarily Varying Remote Sources00.342018
Private Index Coding.00.342018
Wiretapped Oblivious Transfer.00.342017
Oblivious Transfer Over Wireless Channels.00.342016
Function Computation Through a Bidirectional Relay00.342016
Broadcast Function Computation with Complementary Side Information00.342016
The benefit of a 1-bit jump-start, and the necessity of stochastic encoding, in jamming channels.10.392016
Sufficiently myopic adversaries are blind10.352015
Oblivious transfer over OFDM and MIMO channels00.342015
Dirty paper arbitrarily varying channel with a state-aware adversary00.342015
Energy efficient random multiple access with strict delay constraints00.342014
On the adaptive capacity region of fading MACs with distributed CSI10.362014
How to securely compute the modulo-two sum of binary sources40.402014
Distributed Rate Adaptation and Power Control in Fading Multiple Access Channels.20.422014
On the oblivious transfer capacity region of the binary erasure broadcast channel00.342014
The Gaussian CEO competitive pricing game00.342014
Writing on a dirty paper in the presence of jamming.00.342014
Correlated jamming in a Joint Source Channel Communication system00.342014
The oblivious transfer capacity of the wiretapped binary erasure channel70.632014
An MMSE Strategy at Relays With Partial CSI for a Multi-Layer Relay Network00.342014
On fading MAC channels with asymmetric CSI20.582013
Network Flows for Function Computation130.622013
On the adaptive sum-capacity of fading MACs with distributed CSI and non-identical links30.602013
Upper Bounds on the Capacity of Binary Channels With Causal Adversaries110.622013
Power Controlled Adaptive Sum-Capacity of Fading MACs with Distributed CSI10.502012
Power controlled adaptive sum-capacity in the presence of distributed CSI.30.592012
On Network Coding for Sum-Networks401.412012
Improved upper bounds on the capacity of binary channels with causal adversaries.80.582012
Exact topology inference for DAGs using network coding00.342012
On the Separability of Targets Using Binary Proximity Sensors10.372012
Estimating network link characteristics using packet-pair dispersion: A discrete-time queueing theoretic analysis60.452011
Efficient Flow Allocation Algorithms for In-Network Function Computation10.362011
A necessary and sufficient condition for solvability of a 3s/3t sum-network80.702010
A Simple Necessary and Sufficient Condition for the Double Unicast Problem130.722010
Sum-networks: System of polynomial equations, unachievability of coding capacity, reversibility, insufficiency of linear network coding50.492009
A Channel Coding Perspective of Collaborative Filtering70.532009
Estimating Network Link Characteristics using Packet-Pair Dispersion: A Discrete Time Queueing Theoretic View00.342009
Classification of \textit{sum-networks} based on network coding capacity00.342009
Performance Analysis Of Amplify And Forward Based Cooperative Diversity In Mimo Relay Channels70.612009
  • 1
  • 2