Mayank Bakshi

Rawad Bitar

CoRR, 2024

VALID: a Validated Algorithm for Learning in Decentralized Networks with Possible Adversarial Presence.

[BibT_eX]

[DOI]

Narayana Prasad Santhanam

Sara Ghasvarianjahromi

CoRR, 2024

2023

Optimal Information Security Against Limited-View Adversaries: Beyond MDS Codes.

[BibT_eX]

[DOI]

IEEE Trans. Commun., December, 2023

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

[BibT_eX]

[DOI]

CoRR, 2023

Universal Compression of High Dimensional Gaussian Vectors with James-Stein shrinkage.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2023

Hypothesis Testing for Adversarial Channels: Chernoff-Stein Exponents.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2023

On Authentication against a Myopic Adversary using Stochastic Codes.

[BibT_eX]

[DOI]

Oliver Kosut

Proceedings of the IEEE International Symposium on Information Theory, 2023

2022

An accurate and practical algorithm for internet traffic recovery problem.

[BibT_eX]

[DOI]

Neurocomputing, 2022

2021

Covert Communication Over Adversarially Jammed Channels.

[BibT_eX]

[DOI]

Qiaosheng Eric Zhang

IEEE Trans. Inf. Theory, 2021

Triple Decomposition and Tensor Recovery of Third Order Tensors.

[BibT_eX]

[DOI]

SIAM J. Matrix Anal. Appl., 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

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

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

Undetectable Radios: Covert Communication under Spectral Mask Constraints.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2019

Multiple Access Channels with Adversarial Users.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2019

2018

Plausible Deniability Over Broadcast Channels.

[BibT_eX]

[DOI]

Vinod M. Prabhakaran

IEEE Trans. Inf. Theory, 2018

Multipath Stealth Communication with Jammers.

[BibT_eX]

[DOI]

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

2017

Efficient Algorithms for Noisy Group Testing.

[BibT_eX]

[DOI]

Sheng Cai

Mohammad Jahangoshahi

IEEE Trans. Inf. Theory, 2017

Time of Use Tariff parameter Estimation: A Data Analysis Approach on Multicore Systems.

[BibT_eX]

[DOI]

Amit Kalele

Kiran Narkhede

Proceedings of the Companion Proceedings of the 8th ACM/SPEC on International Conference on Performance Engineering, 2017

Coding for networks of compound channels.

[BibT_eX]

[DOI]

Fariba Abbasi

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

Fundamental limits and achievable strategies for low energy compressed sensing with applications in wireless communication.

[BibT_eX]

[DOI]

Tongxin Li

Pulkit Grover

Proceedings of the 17th IEEE International Workshop on Signal Processing Advances in Wireless Communications, 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

2015

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

[BibT_eX]

[DOI]

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

On Accelerating Concurrent PCA Computations for Financial Risk Applications.

[BibT_eX]

[DOI]

Proceedings of the 22nd IEEE International Conference on High Performance Computing, 2015

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

[BibT_eX]

[DOI]

Proceedings of the 10th International Conference on Information, 2015

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

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

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

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

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

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

[BibT_eX]

[DOI]

CoRR, 2012

On network coding capacity under on-off scheduling.

[BibT_eX]

[DOI]

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

2011

On equivalence for networks of noisy channels under byzantine attacks.

[BibT_eX]

[DOI]

Tracey Ho

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

2010

Concatenated Polar codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2010

On zero-error source coding with feedback.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2010

2009

On feedback in network source coding.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2009

2008

On achievable rates for multicast in the presence of side information.

[BibT_eX]

[DOI]

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

A continuity theory for lossless source coding over networks.

[BibT_eX]

[DOI]

Wei-Hsin Gu