Get started
Author

Bikash Kumar Dey

Observed names: B. K. Dey, B.K. Dey, Bikash K Dey, Bikash K. Dey, Dey, B. K., Dey, Bikash, Dey, Bikash K., Dey, Bikash Kumar
ORCID: 0000-0003-0333-2257
Observed ORCID: 0000-0003-0333-2257
OpenAlex ID: A5064926409
Binary causal-adversary channels
2009 · M. Langberg, S. Jaggi, et al. · IEEE International Symposium on Information Theory (ISIT) · 36
PDF
"Real" and "Complex" Network Codes: Promises and Challenges
2008 · S. Shintre, S. Katti, et al. · International Symposium on Network Coding (NetCod) · 30
Sufficiently Myopic Adversaries Are Blind
2019 · Bikash Kumar Dey, Sidharth Jaggi, et al. · IEEE Transactions on Information Theory · 29
Demand-Private Coded Caching and the Exact Trade-off for N=K=2
2020 · Sneha Kamath, Jithin Ravi, et al. · National Conference on Communications · 25
PDF
Network Flows for Function Computation
2013 · Virag Shah, Bikash Kumar Dey, et al. · IEEE Journal on Selected Areas in Communications · 25
Network tomography via network coding
2008 · G. Sharma, S. Jaggi, et al. · Information Theory and Applications Workshop (ITA) · 25
A Simple Necessary and Sufficient Condition for the Double Unicast Problem
2010 · S. Shenvi, B. K. Dey · International Conference on Communications · 23
Sufficiently myopic adversaries are blind
2015 · Bikash Kumar Dey, Sidharth Jaggi, et al. · IEEE International Symposium on Information Theory (ISIT) · 22
Coding against delayed adversaries
2010 · Bikash Kumar Dey, Sidharth Jaggi, et al. · IEEE International Symposium on Information Theory (ISIT) · 22
Codes Against Online Adversaries: Large Alphabets
2013 · Bikash Kumar Dey, Sidharth Jaggi, et al. · IEEE Transactions on Information Theory · 21
Fundamental Limits of Demand-Private Coded Caching
2022 · Chinmay Gurjarpadhye, Jithin Ravi, et al. · IEEE Transactions on Information Theory · 19
PDF
Improved upper bounds on the capacity of binary channels with causal adversaries
2012 · Bikash Kumar Dey, Sidharth Jaggi, et al. · IEEE International Symposium on Information Theory (ISIT) · 19
Fq-linear Cyclic Codes over $$F{_q^m}$$ : DFT Approach
2005 · Bikash Kumar Dey, B. Sundar Rajan · Designs Codes and Cryptography · 19
Some results on communicating the sum of sources over a network
2009 · B.K. Rai, B.K. Dey, et al. · International Symposium on Network Coding (NetCod) · 18
PDF
A necessary and sufficient condition for solvability of a 3s/3t sum-network
2010 · Sagar Shenvi, Bikash Kumar Dey · IEEE International Symposium on Information Theory (ISIT) · 17
Codes against online adversaries
2009 · B. K. Dey, S. Jaggi, et al. · Allerton Conference on Communication, Control, and Computing · 17
PDF
Performance Analysis of Amplify and Forward Based Cooperative Diversity in MIMO Relay Channels
2009 · Vijay Ganwani, Bikash Kumar Dey, et al. · IEEE Vehicular Technology Conference · 17
Some bounds on the capacity of communicating the sum of sources
2010 · Brijesh Kumar Rai, Bikash Kumar Dey, et al. · IEEE Information Theory Workshop (ITW) · 16
PDF
The oblivious transfer capacity of the wiretapped binary erasure channel
2014 · Manoj Mishra, Bikash Kumar Dey, et al. · IEEE International Symposium on Information Theory (ISIT) · 15
PDF
Estimating network link characteristics using packet-pair dispersion: A discrete-time queueing theoretic analysis
2010 · Bikash Kumar Dey, D. Manjunath, et al. · Computer Networks · 15
On Existence of Good Self-Dual Quasi-Cyclic Codes
2004 · B.K. Dey · IEEE Transactions on Information Theory · 15
Private Index Coding
2018 · Varun Narayanan, Vinod M. Prabhakaran, et al. · IEEE International Symposium on Information Theory (ISIT) · 14
PDF
Distributed Rate Adaptation and Power Control in Fading Multiple Access Channels
2015 · Sreejith Sreekumar, Bikash Kumar Dey, et al. · IEEE Transactions on Information Theory · 14
PDF
An Mmse Based Weighted Aggregation Scheme For Event Detection Using Wireless Sensor Network
2006 · Desai, Uday, Dey, Bikash, et al. · 14
Codes Closed under Arbitrary Abelian Group of Permutations
2004 · Bikash Kumar Dey, B. Sundar Rajan · SIAM Journal on Discrete Mathematics · 14
Works count: 119
Citation count: 797
H-index: 17
I10-index: 34
Year
Topic
Type