Bikash Kumar Dey

CoRR, 2024

Sequential Adversarial Hypothesis Testing.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2024

Computationally Efficient Codes for Strongly Dobrushin-Stambler Nonsymmetrizable Oblivious AVCs.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2024

2023

Byzantine Multiple Access Channels - Part II: Communication With Adversary Identification.

[BibT_eX]

[DOI]

CoRR, 2023

Hypothesis Testing for Adversarial Channels: Chernoff-Stein Exponents.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2023

2022

Private Index Coding.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2022

Fundamental Limits of Demand-Private Coded Caching.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2022

On the Error Exponents for Common Message Broadcasting over DMCs with Feedback.

[BibT_eX]

[DOI]

Abhishek Sarkar

Proceedings of the IEEE International Conference on Signal Processing and Communications, 2022

2021

Communication With Adversary Identification in Byzantine Multiple Access Channels.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2021

Compound Arbitrarily Varying Channels.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2021

2020

Demand-Private Coded Caching and the Exact Trade-off for N=K=2.

[BibT_eX]

[DOI]

Sneha Kamath

Proceedings of the 2020 National Conference on Communications, 2020

Improved Memory-Rate Trade-off for Caching with Demand Privacy.

[BibT_eX]

[DOI]

Proceedings of the IEEE Information Theory Workshop, 2020

Symmetrizability for Myopic AVCs.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2020

2019

Function Computation Through a Bidirectional Relay.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2019

Sufficiently Myopic Adversaries Are Blind.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2019

Byzantine Multiple Access.

[BibT_eX]

[DOI]

CoRR, 2019

Multiple Access Channels with Byzantine Users.

[BibT_eX]

[DOI]

Proceedings of the 2019 IEEE Information Theory Workshop, 2019

Multiple Access Channels with Adversarial Users.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2019

The Interplay of Causality and Myopia in Adversarial Channel Models.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2019

2018

Arbitrarily Varying Remote Sources.

[BibT_eX]

[DOI]

CoRR, 2018

On the Rate Distortion Function of Arbitrarily Varying Remote Sources.

[BibT_eX]

[DOI]

Proceedings of the IEEE Information Theory Workshop, 2018

Quadratically Constrained Channels with Causal Adversaries.

[BibT_eX]

[DOI]

Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

2017

Wiretapped Oblivious Transfer.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2017

Communication in the Presence of a State-Aware Adversary.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2017

Coding for arbitrarily varying remote sources.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

2016

Oblivious Transfer Over Wireless Channels.

[BibT_eX]

[DOI]

Emanuele Viterbo

IEEE Trans. Commun., 2016

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

[BibT_eX]

[DOI]

CoRR, 2016

A bit of delay is sufficient and stochastic encoding is necessary to overcome online adversarial erasures.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2016

Broadcast Function Computation with Complementary Side Information.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2015

Oblivious transfer over OFDM and MIMO channels.

[BibT_eX]

[DOI]

Emanuele Viterbo

Proceedings of the 2015 IEEE Information Theory Workshop, 2015

Zero-error function computation through a bidirectional relay.

[BibT_eX]

[DOI]

Proceedings of the 2015 IEEE Information Theory Workshop, 2015

Dirty paper arbitrarily varying channel with a state-aware adversary.

[BibT_eX]

[DOI]

Pannir Selvam Elamvazhuthi

Proceedings of the 2015 IEEE Information Theory Workshop, 2015

Private data transfer over a broadcast channel.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2015

On the oblivious transfer capacity of the degraded wiretapped binary erasure channel.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Srikrishna Bhashyam

IEEE Trans. Signal Process., 2014

On the adaptive capacity region of fading MACs with distributed CSI.

[BibT_eX]

[DOI]

Proceedings of the 2014 IEEE Information Theory Workshop, 2014

On the oblivious transfer capacity region of the binary erasure broadcast channel.

[BibT_eX]

[DOI]

Proceedings of the 2014 IEEE Information Theory Workshop, 2014

How to securely compute the modulo-two sum of binary sources.

[BibT_eX]

[DOI]

Proceedings of the 2014 IEEE Information Theory Workshop, 2014

Energy efficient random multiple access with strict delay constraints.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

The Gaussian CEO competitive pricing game.

[BibT_eX]

[DOI]

Proceedings of the Sixth International Conference on Communication Systems and Networks, 2014

2013

Upper Bounds on the Capacity of Binary Channels With Causal Adversaries.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2013

Codes Against Online Adversaries: Large Alphabets.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2013

Network Flows for Function Computation.

[BibT_eX]

[DOI]

Virag Shah

IEEE J. Sel. Areas Commun., 2013

On the adaptive sum-capacity of fading MACs with distributed CSI and non-identical links.

[BibT_eX]

[DOI]

Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

On fading MAC channels with asymmetric CSI.

[BibT_eX]

[DOI]

Kamal Singh

Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

2012

On Network Coding for Sum-Networks.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2012

On the Separability of Targets Using Binary Proximity Sensors

[BibT_eX]

[DOI]

CoRR, 2012

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

[BibT_eX]

[DOI]

CoRR, 2012

Exact topology inference for DAGs using network coding.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Network Coding, 2012

Power controlled adaptive sum-capacity in the presence of distributed CSI.

[BibT_eX]

[DOI]

Krishnamoorthy Iyer

Proceedings of the International Symposium on Information Theory and its Applications, 2012

Improved upper bounds on the capacity of binary channels with causal adversaries.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Wirel. Pers. Commun., 2011

A Channel Coding Perspective of Collaborative Filtering.

[BibT_eX]

[DOI]

S. T. Aditya

Onkar Dabeer

IEEE Trans. Inf. Theory, 2011

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

[BibT_eX]

[DOI]

Supriyo Chakraborty

Comput. Networks, 2011

On the sum capacity of multiaccess block-fading channels with individual side information.

[BibT_eX]

[DOI]

Yash Deshpande

Proceedings of the 2011 IEEE Information Theory Workshop, 2011

Network flows for functions.

[BibT_eX]

[DOI]

Virag Shah

Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Efficient Flow Allocation Algorithms for In-Network Function Computation.

[BibT_eX]

[DOI]

Virag Shah

Proceedings of the Global Communications Conference, 2011

2010

A necessary and sufficient condition for solvability of a 3s/3t sum-network.

[BibT_eX]

[DOI]

Sagar Shenvi

Proceedings of the IEEE International Symposium on Information Theory, 2010

Coding against delayed adversaries.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2010

A Simple Necessary and Sufficient Condition for the Double Unicast Problem.

[BibT_eX]

[DOI]

Sagar Shenvi

Proceedings of IEEE International Conference on Communications, 2010

2009

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

[BibT_eX]

[DOI]

Supriyo Chakraborty

CoRR, 2009

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

[BibT_eX]

[DOI]

CoRR, 2009

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

[BibT_eX]

[DOI]

CoRR, 2009

Performance Analysis of Amplify and Forward Based Cooperative Diversity in MIMO Relay Channels.

[BibT_eX]

[DOI]

Proceedings of the 69th IEEE Vehicular Technology Conference, 2009

Feasible alphabets for communicating the sum of sources over a network.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2009

Binary causal-adversary channels.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2009

A channel coding perspective of recommendation systems.

[BibT_eX]

[DOI]

S. T. Aditya

Onkar Dabeer

Proceedings of the IEEE International Symposium on Information Theory, 2009

Codes against online adversaries.

[BibT_eX]

[DOI]

Proceedings of the 47th Annual Allerton Conference on Communication, 2009

2008

An Efficient Multibit Aggregation Scheme for Multihop Wireless Sensor Networks.

[BibT_eX]

[DOI]

EURASIP J. Wirel. Commun. Netw., 2008

Some results on communicating the sum of sources over a network

[BibT_eX]

[DOI]

Pannir Selvam Elamvazhuthi

Abhay Karandikar

CoRR, 2008

DSTC Layering Protocols in Wireless Cooperative Networks

[BibT_eX]

[DOI]

Parag Shankar Kulkarni

CoRR, 2008

"Real" Slepian-Wolf Codes

[BibT_eX]

[DOI]

CoRR, 2008

"Real" Slepian-Wolf codes.

[BibT_eX]

[DOI]

Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

MAAS: Multibit Adaptive Aggregation Scheme for wireless sensor networks.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Subhendu Batabyal

V. Umapathi Reddy

IEEE Trans. Veh. Technol., 2007

2006

An MMSE based weighted aggregation scheme for event detection using wireless sensor network.

[BibT_eX]

[DOI]

Proceedings of the 14th European Signal Processing Conference, 2006

2005

Fq-linear Cyclic Codes over Fqm: DFT Approach.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2005

2004

Affine invariant extended cyclic codes over Galois rings.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2004

On Existence of Good Self-Dual Quasi-Cyclic Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2004

Codes Closed under Arbitrary Abelian Group of Permutations.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2004

On existence of good self-dual quasicyclic codes.

[BibT_eX]

[DOI]

Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

2003

DFT Domain Characterization of Quasi-Cyclic Codes.

[BibT_eX]

[DOI]

Appl. Algebra Eng. Commun. Comput., 2003

2001

Fq-Linear Cyclic Codes over Fq: DFT Characterization.

[BibT_eX]

[DOI]