Bikash Kumar Dey

According to our database1, Bikash Kumar Dey authored at least 77 papers between 2001 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
Demand-Private Coded Caching and the Exact Trade-off for N=K=2.
Proceedings of the 2020 National Conference on Communications, 2020

Symmetrizability for Myopic AVCs.
Proceedings of the IEEE International Symposium on Information Theory, 2020

2019
Function Computation Through a Bidirectional Relay.
IEEE Trans. Inf. Theory, 2019

Sufficiently Myopic Adversaries Are Blind.
IEEE Trans. Inf. Theory, 2019

Byzantine Multiple Access.
CoRR, 2019

Multiple Access Channels with Byzantine Users.
Proceedings of the 2019 IEEE Information Theory Workshop, 2019

Multiple Access Channels with Adversarial Users.
Proceedings of the IEEE International Symposium on Information Theory, 2019

The Interplay of Causality and Myopia in Adversarial Channel Models.
Proceedings of the IEEE International Symposium on Information Theory, 2019

2018
Arbitrarily Varying Remote Sources.
CoRR, 2018

On the Rate Distortion Function of Arbitrarily Varying Remote Sources.
Proceedings of the IEEE Information Theory Workshop, 2018

Private Index Coding.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

Quadratically Constrained Channels with Causal Adversaries.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

2017
Wiretapped Oblivious Transfer.
IEEE Trans. Inf. Theory, 2017

Communication in the Presence of a State-Aware Adversary.
IEEE Trans. Inf. Theory, 2017

Coding for arbitrarily varying remote sources.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

2016
Oblivious Transfer Over Wireless Channels.
IEEE Trans. Commun., 2016

The benefit of a 1-bit jump-start, and the necessity of stochastic encoding, in jamming channels.
CoRR, 2016

A bit of delay is sufficient and stochastic encoding is necessary to overcome online adversarial erasures.
Proceedings of the IEEE International Symposium on Information Theory, 2016

Broadcast Function Computation with Complementary Side Information.
Proceedings of the 2016 IEEE Globecom Workshops, Washington, DC, USA, December 4-8, 2016, 2016

2015
Distributed Rate Adaptation and Power Control in Fading Multiple Access Channels.
IEEE Trans. Inf. Theory, 2015

Oblivious transfer over OFDM and MIMO channels.
Proceedings of the 2015 IEEE Information Theory Workshop, 2015

Zero-error function computation through a bidirectional relay.
Proceedings of the 2015 IEEE Information Theory Workshop, 2015

Dirty paper arbitrarily varying channel with a state-aware adversary.
Proceedings of the 2015 IEEE Information Theory Workshop, 2015

Private data transfer over a broadcast channel.
Proceedings of the IEEE International Symposium on Information Theory, 2015

On the oblivious transfer capacity of the degraded wiretapped binary erasure channel.
Proceedings of the IEEE International Symposium on Information Theory, 2015

2014
An MMSE Strategy at Relays With Partial CSI for a Multi-Layer Relay Network.
IEEE Trans. Signal Process., 2014

On the adaptive capacity region of fading MACs with distributed CSI.
Proceedings of the 2014 IEEE Information Theory Workshop, 2014

On the oblivious transfer capacity region of the binary erasure broadcast channel.
Proceedings of the 2014 IEEE Information Theory Workshop, 2014

How to securely compute the modulo-two sum of binary sources.
Proceedings of the 2014 IEEE Information Theory Workshop, 2014

Energy efficient random multiple access with strict delay constraints.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

The oblivious transfer capacity of the wiretapped binary erasure channel.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Correlated jamming in a Joint Source Channel Communication system.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Writing on a dirty paper in the presence of jamming.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

The Gaussian CEO competitive pricing game.
Proceedings of the Sixth International Conference on Communication Systems and Networks, 2014

2013
Upper Bounds on the Capacity of Binary Channels With Causal Adversaries.
IEEE Trans. Inf. Theory, 2013

Codes Against Online Adversaries: Large Alphabets.
IEEE Trans. Inf. Theory, 2013

Network Flows for Function Computation.
IEEE J. Sel. Areas Commun., 2013

On the adaptive sum-capacity of fading MACs with distributed CSI and non-identical links.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

On fading MAC channels with asymmetric CSI.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

2012
On Network Coding for Sum-Networks.
IEEE Trans. Inf. Theory, 2012

On the Separability of Targets Using Binary Proximity Sensors
CoRR, 2012

Power Controlled Adaptive Sum-Capacity of Fading MACs with Distributed CSI
CoRR, 2012

Exact topology inference for DAGs using network coding.
Proceedings of the International Symposium on Network Coding, 2012

Power controlled adaptive sum-capacity in the presence of distributed CSI.
Proceedings of the International Symposium on Information Theory and its Applications, 2012

Improved upper bounds on the capacity of binary channels with causal adversaries.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

2011
Blind Adaptive Weighted Aggregation Scheme for Event Detection in Multihop Wireless Sensor Networks.
Wirel. Pers. Commun., 2011

A Channel Coding Perspective of Collaborative Filtering.
IEEE Trans. Inf. Theory, 2011

Estimating network link characteristics using packet-pair dispersion: A discrete-time queueing theoretic analysis.
Comput. Networks, 2011

On the sum capacity of multiaccess block-fading channels with individual side information.
Proceedings of the 2011 IEEE Information Theory Workshop, 2011

Network flows for functions.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Efficient Flow Allocation Algorithms for In-Network Function Computation.
Proceedings of the Global Communications Conference, 2011

2010
A necessary and sufficient condition for solvability of a 3s/3t sum-network.
Proceedings of the IEEE International Symposium on Information Theory, 2010

Coding against delayed adversaries.
Proceedings of the IEEE International Symposium on Information Theory, 2010

A Simple Necessary and Sufficient Condition for the Double Unicast Problem.
Proceedings of IEEE International Conference on Communications, 2010

2009
Estimating Network Link Characteristics using Packet-Pair Dispersion: A Discrete Time Queueing Theoretic View
CoRR, 2009

Classification of \textit{sum-networks} based on network coding capacity
CoRR, 2009

Sum-networks: System of polynomial equations, unachievability of coding capacity, reversibility, insufficiency of linear network coding
CoRR, 2009

Performance Analysis of Amplify and Forward Based Cooperative Diversity in MIMO Relay Channels.
Proceedings of the 69th IEEE Vehicular Technology Conference, 2009

Feasible alphabets for communicating the sum of sources over a network.
Proceedings of the IEEE International Symposium on Information Theory, 2009

Binary causal-adversary channels.
Proceedings of the IEEE International Symposium on Information Theory, 2009

A channel coding perspective of recommendation systems.
Proceedings of the IEEE International Symposium on Information Theory, 2009

2008
An Efficient Multibit Aggregation Scheme for Multihop Wireless Sensor Networks.
EURASIP J. Wirel. Commun. Netw., 2008

Codes against Online Adversaries
CoRR, 2008

Some results on communicating the sum of sources over a network
CoRR, 2008

DSTC Layering Protocols in Wireless Cooperative Networks
CoRR, 2008

"Real" Slepian-Wolf Codes
CoRR, 2008

"Real" Slepian-Wolf codes.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

MAAS: Multibit Adaptive Aggregation Scheme for wireless sensor networks.
Proceedings of the 2008 International Conference on Telecommunications, 2008

2007
A Code Set for a Robust 8.25 Mb/s Data Rate for IEEE 802.11b WLANs.
IEEE Trans. Veh. Technol., 2007

2006
An MMSE based weighted aggregation scheme for event detection using wireless sensor network.
Proceedings of the 14th European Signal Processing Conference, 2006

2005
<i>F</i><sub><i>q</i></sub>-linear Cyclic Codes over F<sub>q</sub><sup>m</sup>: DFT Approach.
Des. Codes Cryptogr., 2005

2004
Affine invariant extended cyclic codes over Galois rings.
IEEE Trans. Inf. Theory, 2004

On Existence of Good Self-Dual Quasi-Cyclic Codes.
IEEE Trans. Inf. Theory, 2004

Codes Closed under Arbitrary Abelian Group of Permutations.
SIAM J. Discret. Math., 2004

On existence of good self-dual quasicyclic codes.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

2003
DFT Domain Characterization of Quasi-Cyclic Codes.
Appl. Algebra Eng. Commun. Comput., 2003

2001
F<sub>q</sub>-Linear Cyclic Codes over F<sub>q</sub>: DFT Characterization.
Proceedings of the Applied Algebra, 2001


  Loading...