Sidharth Jaggi

Mohammadreza Alimohammadi

Qiaoqiao Zhou

IEEE Trans. Inf. Theory, March, 2023

Learning Analytics from Spoken Discussion Dialogs in Flipped Classroom.

[BibT_eX]

[DOI]

CoRR, 2023

Computationally Efficient Codes for Adversarial Binary-Erasure Channels.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2023

2022

Quadratically Constrained Myopic Adversarial Channels.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2022

The Capacity of Causal Adversarial Channels.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2022

New Results on AVCs with Omniscient and Myopic Adversaries.

[BibT_eX]

[DOI]

Anuj Kumar Yadav

Proceedings of the IEEE International Symposium on Information Theory, 2022

On the Capacity of Additive AVCs with Feedback.

[BibT_eX]

[DOI]

Pranav Joshi

Amritakshya Purkayastha

Proceedings of the IEEE International Symposium on Information Theory, 2022

2021

Covert Communication Over Adversarially Jammed Channels.

[BibT_eX]

[DOI]

Qiaosheng Eric Zhang

IEEE Trans. Inf. Theory, 2021

Network Coding With Myopic Adversaries.

[BibT_eX]

[DOI]

IEEE J. Sel. Areas Inf. Theory, 2021

Generalized Non-adaptive Group Testing.

[BibT_eX]

[DOI]

Xiwei Cheng

Qiaoqiao Zhou

CoRR, 2021

Tight List-Sizes for Oblivious AVCs under Constraints.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2021

2020

Covert Communication With Polynomial Computational Complexity.

[BibT_eX]

[DOI]

Qiaosheng Eric Zhang

IEEE Trans. Inf. Theory, 2020

Stealthy Communication Over Adversarially Jammed Multipath Networks.

[BibT_eX]

[DOI]

IEEE Trans. Commun., 2020

Quadratically Constrained Two-way Adversarial Channels.

[BibT_eX]

[DOI]

Shashank Vatedka

Proceedings of the IEEE International Symposium on Information Theory, 2020

Empirical Properties of Good Channel Codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2020

Symmetrizability for Myopic AVCs.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2020

Communication Efficient Secret Sharing in the Presence of Malicious Adversary.

[BibT_eX]

[DOI]

Rawad Bitar

Proceedings of the IEEE International Symposium on Information Theory, 2020

Generalized List Decoding.

[BibT_eX]

[DOI]

Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020

2019

Nearly Optimal Sparse Group Testing.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2019

Sufficiently Myopic Adversaries Are Blind.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2019

The Capacity of Online (Causal) $q$ -Ary Error-Erasure Channels.

[BibT_eX]

[DOI]

Zitan Chen

IEEE Trans. Inf. Theory, 2019

Undetectable Radios: Covert Communication under Spectral Mask Constraints.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2019

When are large codes possible for AVCs?

[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

Shared Randomness in Arbitrarily Varying Channels.

[BibT_eX]

[DOI]

Sagnik Bhattacharya

Proceedings of the IEEE International Symposium on Information Theory, 2019

2018

End-to-End Error-Correcting Codes on Networks With Worst-Case Bit Errors.

[BibT_eX]

[DOI]

Qiwen Wang

IEEE Trans. Inf. Theory, 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

Multipath Stealth Communication with Jammers.

[BibT_eX]

[DOI]

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

Quadratically Constrained Channels with Causal Adversaries.

[BibT_eX]

[DOI]

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

Secure Adaptive Group Testing.

[BibT_eX]

[DOI]

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

Communication over an Arbitrarily Varying Channel under a State-Myopic Encoder.

[BibT_eX]

[DOI]

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

Novel Impossibility Results for Group-Testing.

[BibT_eX]

[DOI]

Abhishek Agarwal

Arya Mazumdar

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

2017

File Updates Under Random/Arbitrary Insertions and Deletions.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2017

Learning Immune-Defectives Graph Through Group Tests.

[BibT_eX]

[DOI]

Abhinav Ganesan

Venkatesh Saligrama

IEEE Trans. Inf. Theory, 2017

Efficient Algorithms for Noisy Group Testing.

[BibT_eX]

[DOI]

Sheng Cai

Mohammad Jahangoshahi

IEEE Trans. Inf. Theory, 2017

Two-way interference channels with jammers.

[BibT_eX]

[DOI]

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

2016

SHO-FA: Robust Compressive Sensing With Order-Optimal Complexity, Measurements, and Bits.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2016

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

[BibT_eX]

[DOI]

CoRR, 2016

Computationally efficient deniable communication.

[BibT_eX]

[DOI]

Qiaosheng Eric Zhang

Proceedings of the IEEE International Symposium on Information Theory, 2016

Arbitrarily varying networks: Capacity-achieving computationally efficient codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 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

2015

End-to-End Error-Correcting Codes on Networks with Worst-Case Symbol Errors.

[BibT_eX]

[DOI]

Qiwen Wang

CoRR, 2015

A Characterization of the Capacity of Online (causal) Binary Channels.

[BibT_eX]

[DOI]

Zitan Chen

Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015

Talking reliably, secretly, and efficiently: A "complete" characterization.

[BibT_eX]

[DOI]

Proceedings of the 2015 IEEE Information Theory Workshop, 2015

Non-adaptive group testing with inhibitors.

[BibT_eX]

[DOI]

Abhinav Ganesan

Venkatesh Saligrama

Proceedings of the 2015 IEEE Information Theory Workshop, 2015

Zero error coordination.

[BibT_eX]

[DOI]

Mahed Abroshan

Amin Aminzadeh Gohari

Proceedings of the 2015 IEEE Information Theory Workshop, 2015

Coding against a limited-view adversary: The effect of causality and feedback.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2015

Generalized belief propagation for estimating the partition function of the 2D Ising model.

[BibT_eX]

[DOI]

Chun Lam Chan

Mahdi Jafari Siavoshani

Navin Kashyap

Pascal O. Vontobel

Proceedings of the IEEE International Symposium on Information Theory, 2015

Reliable and secure communication over adversarial multipath networks: A survey.

[BibT_eX]

[DOI]

Proceedings of the 10th International Conference on Information, 2015

2014

Network Codes Resilient to Jamming and Eavesdropping.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 2014

Non-Adaptive Group Testing: Explicit Bounds and Novel Algorithms.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2014

Non-Adaptive Group Testing with Inhibitors.

[BibT_eX]

[DOI]

CoRR, 2014

SUPER: Sparse signals with Unknown Phases Efficiently Recovered.

[BibT_eX]

[DOI]

CoRR, 2014

Reliable, deniable and hidable communication: A quick survey.

[BibT_eX]

[DOI]

Proceedings of the 2014 IEEE Information Theory Workshop, 2014

Reliable deniable communication with channel uncertainty.

[BibT_eX]

[DOI]

Proceedings of the 2014 IEEE Information Theory Workshop, 2014

Reliable, deniable and hidable communication.

[BibT_eX]

[DOI]

Proceedings of the 2014 Information Theory and Applications Workshop, 2014

Group testing with prior statistics.

[BibT_eX]

[DOI]

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

Reliable, deniable, and hidable communication over multipath networks.

[BibT_eX]

[DOI]

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

SUPER: Sparse signals with unknown phases efficiently recovered.

[BibT_eX]

[DOI]

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

FRANTIC: A Fast Reference-based Algorithm for Network Tomography via compressive sensing.

[BibT_eX]

[DOI]

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

2013

Beyond the Cut-Set Bound: Uncertainty Computations in Network Coding With Correlated Sources.

[BibT_eX]

[DOI]

Amin Aminzadeh Gohari

Shenghao Yang

IEEE Trans. Inf. Theory, 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

Inter-Session Network Coding with Strategic Users: A Game-Theoretic Analysis of the Butterfly Network.

[BibT_eX]

[DOI]

Amir Hamed Mohsenian Rad

IEEE Trans. Commun., 2013

Near-Optimal Stochastic Threshold Group Testing

[BibT_eX]

[DOI]

CoRR, 2013

FRANTIC: A Fast Reference-based Algorithm for Network Tomography via Compressive Sensing.

[BibT_eX]

[DOI]

CoRR, 2013

Routing for security in networks with adversarial nodes.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Network Coding, 2013

Stochastic threshold group testing.

[BibT_eX]

[DOI]

Proceedings of the 2013 IEEE Information Theory Workshop, 2013

On AVCs with quadratic constraints.

[BibT_eX]

[DOI]

Farzin Haddadpour

Mahdi Jafari Siavoshani

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

Reliable deniable communication: Hiding messages in noise.

[BibT_eX]

[DOI]

Pak Hou Che

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

Rateless resilient network coding against byzantine adversaries.

[BibT_eX]

[DOI]

Proceedings of the IEEE INFOCOM 2013, Turin, Italy, April 14-19, 2013, 2013

GROTESQUE: Noisy Group Testing (Quick and Efficient).

[BibT_eX]

[DOI]

Sheng Cai

Mohammad Jahangoshahi

Proceedings of the 51st Annual Allerton Conference on Communication, 2013

2012

Passive Network Tomography for Erroneous Networks: A Network Coding Approach.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2012

SHO-FA: Robust compressive sensing with order-optimal complexity, measurements, and bits

[BibT_eX]

[DOI]

CoRR, 2012

Analog Network Coding in General SNR Regime: Performance of Network Simplification

[BibT_eX]

[DOI]

CoRR, 2012

Analog Network Coding in General SNR Regime: Performance of A Greedy Scheme

[BibT_eX]

[DOI]

CoRR, 2012

Secure Compressed Reading in Smart Grids

[BibT_eX]

[DOI]

CoRR, 2012

Analog Network Coding in General SNR Regime

[BibT_eX]

[DOI]

CoRR, 2012

Analog network coding in general SNR regime: Performance of a greedy scheme.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Network Coding, 2012

Analog network coding in general SNR regime: Performance of network simplification.

[BibT_eX]

[DOI]

Proceedings of the 2012 IEEE Information Theory Workshop, 2012

On erasure correction coding for streaming.

[BibT_eX]

[DOI]

Proceedings of the 2012 Information Theory and Applications Workshop, 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

Analog network coding in general SNR regime.

[BibT_eX]

[DOI]

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

2011

Multiple-Access Network Information-Flow and Correction Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2011

Amplify-and-Forward in Wireless Relay Networks

[BibT_eX]

[DOI]

CoRR, 2011

Low-Complexity Near-Optimal Codes for Gaussian Relay Networks

[BibT_eX]

[DOI]

Amir Salman Avestimehr

Tracey Ho

CoRR, 2011

Binary error correcting network codes.

[BibT_eX]

[DOI]

Qiwen Wang

Shuo-Yen Robert Li

Proceedings of the 2011 IEEE Information Theory Workshop, 2011

Amplify-and-forward in wireless relay networks.

[BibT_eX]

[DOI]

Proceedings of the 2011 IEEE Information Theory Workshop, 2011

Delay invariant convolutional network codes.

[BibT_eX]

[DOI]

Qifu Tyler Sun

Shuo-Yen Robert Li

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

Universal and robust distributed network codes.

[BibT_eX]

[DOI]

Proceedings of the INFOCOM 2011. 30th IEEE International Conference on Computer Communications, 2011

Non-adaptive probabilistic group testing with noisy measurements: Near-optimal bounds with efficient algorithms.

[BibT_eX]

[DOI]

Proceedings of the 49th Annual Allerton Conference on Communication, 2011

2010

Multiple Access Network Information-flow And Correction codes

[BibT_eX]

[DOI]

Tracey Ho

CoRR, 2010

Multi-source operator channels: Efficient capacity-achieving codes.

[BibT_eX]

[DOI]

Tracey Ho

Proceedings of the 2010 IEEE Information Theory Workshop, 2010

Coding against delayed adversaries.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2010

Concatenated Polar codes.

[BibT_eX]

[DOI]

Michelle Effros

Proceedings of the IEEE International Symposium on Information Theory, 2010

Network Coding Tomography for Network Failures.

[BibT_eX]

[DOI]

Proceedings of the INFOCOM 2010. 29th IEEE International Conference on Computer Communications, 2010

RIPPLE Authentication for Network Coding.

[BibT_eX]

[DOI]

Proceedings of the INFOCOM 2010. 29th IEEE International Conference on Computer Communications, 2010

2009

Network coding tomography for network failures

[BibT_eX]

[DOI]

CoRR, 2009

Inter-Session Network Coding with Strategic Users: A Game-Theoretic Analysis of Network Coding

[BibT_eX]

[DOI]

Amir Hamed Mohsenian Rad

CoRR, 2009

Binary causal-adversary channels.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2009

To code or not to code: Rate optimality in node-capacitated networks.

[BibT_eX]

[DOI]

Ziyu Shao

Shuo-Yen Robert Li

Proceedings of the IEEE International Symposium on Information Theory, 2009

A Game-Theoretic Analysis of Inter-Session Network Coding.

[BibT_eX]

[DOI]

Amir Hamed Mohsenian Rad

Proceedings of IEEE International Conference on Communications, 2009

Codes against online adversaries.

[BibT_eX]

[DOI]

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

2008

Resilient Network Coding in the Presence of Byzantine Adversaries.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2008

Network coding.

[BibT_eX]

[DOI]

J. Commun. Networks, 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

2007

Resilient network codes in the presence of eavesdropping Byzantine adversaries.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2007

Resilient Network Coding in the Presence of Byzantine Adversaries.

[BibT_eX]

[DOI]

Proceedings of the INFOCOM 2007. 26th IEEE International Conference on Computer Communications, 2007

Distributed Functional Compression through Graph Coloring.

[BibT_eX]

[DOI]

Proceedings of the 2007 Data Compression Conference (DCC 2007), 2007

2006

Low Complexity Encoding for Network Codes.

[BibT_eX]

[DOI]

Yuval Cassuto

Michelle Effros

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

2005

Polynomial time algorithms for multicast network code construction.

[BibT_eX]

[DOI]

Ludo M. G. M. Tolhuizen

IEEE Trans. Inf. Theory, 2005

Correction of adversarial errors in networks.

[BibT_eX]

[DOI]

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

2004

Communication and distributional complexity of joint probability mass functions.

[BibT_eX]

[DOI]