Sidharth Jaggi

According to our database1, Sidharth Jaggi authored at least 118 papers between 2004 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Optimal Information Security Against Limited-View Adversaries: Beyond MDS Codes.
IEEE Trans. Commun., December, 2023

Generalized Group Testing.
IEEE Trans. Inf. Theory, March, 2023

Learning Analytics from Spoken Discussion Dialogs in Flipped Classroom.
CoRR, 2023

Computationally Efficient Codes for Adversarial Binary-Erasure Channels.
Proceedings of the IEEE International Symposium on Information Theory, 2023

2022
Quadratically Constrained Myopic Adversarial Channels.
IEEE Trans. Inf. Theory, 2022

The Capacity of Causal Adversarial Channels.
Proceedings of the IEEE International Symposium on Information Theory, 2022

New Results on AVCs with Omniscient and Myopic Adversaries.
Proceedings of the IEEE International Symposium on Information Theory, 2022

On the Capacity of Additive AVCs with Feedback.
Proceedings of the IEEE International Symposium on Information Theory, 2022

2021
Covert Communication Over Adversarially Jammed Channels.
IEEE Trans. Inf. Theory, 2021

Network Coding With Myopic Adversaries.
IEEE J. Sel. Areas Inf. Theory, 2021

Generalized Non-adaptive Group Testing.
CoRR, 2021

Tight List-Sizes for Oblivious AVCs under Constraints.
Proceedings of the IEEE International Symposium on Information Theory, 2021

2020
Covert Communication With Polynomial Computational Complexity.
IEEE Trans. Inf. Theory, 2020

Stealthy Communication Over Adversarially Jammed Multipath Networks.
IEEE Trans. Commun., 2020

Quadratically Constrained Two-way Adversarial Channels.
Proceedings of the IEEE International Symposium on Information Theory, 2020

Empirical Properties of Good Channel Codes.
Proceedings of the IEEE International Symposium on Information Theory, 2020

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

Communication Efficient Secret Sharing in the Presence of Malicious Adversary.
Proceedings of the IEEE International Symposium on Information Theory, 2020

Generalized List Decoding.
Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020

2019
Nearly Optimal Sparse Group Testing.
IEEE Trans. Inf. Theory, 2019

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

The Capacity of Online (Causal) $q$ -Ary Error-Erasure Channels.
IEEE Trans. Inf. Theory, 2019

Undetectable Radios: Covert Communication under Spectral Mask Constraints.
Proceedings of the IEEE International Symposium on Information Theory, 2019

When are large codes possible for AVCs?
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

Shared Randomness in Arbitrarily Varying Channels.
Proceedings of the IEEE International Symposium on Information Theory, 2019

2018
End-to-End Error-Correcting Codes on Networks With Worst-Case Bit Errors.
IEEE Trans. Inf. Theory, 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

Multipath Stealth Communication with Jammers.
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

Secure Adaptive Group Testing.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

Communication over an Arbitrarily Varying Channel under a State-Myopic Encoder.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

Novel Impossibility Results for Group-Testing.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

2017
File Updates Under Random/Arbitrary Insertions and Deletions.
IEEE Trans. Inf. Theory, 2017

Learning Immune-Defectives Graph Through Group Tests.
IEEE Trans. Inf. Theory, 2017

Efficient Algorithms for Noisy Group Testing.
IEEE Trans. Inf. Theory, 2017

Two-way interference channels with jammers.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

2016
SHO-FA: Robust Compressive Sensing With Order-Optimal Complexity, Measurements, and Bits.
IEEE Trans. Inf. Theory, 2016

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

Computationally efficient deniable communication.
Proceedings of the IEEE International Symposium on Information Theory, 2016

Arbitrarily varying networks: Capacity-achieving computationally efficient codes.
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.
Proceedings of the IEEE International Symposium on Information Theory, 2016

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

A Characterization of the Capacity of Online (causal) Binary Channels.
Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015

Talking reliably, secretly, and efficiently: A "complete" characterization.
Proceedings of the 2015 IEEE Information Theory Workshop, 2015

Non-adaptive group testing with inhibitors.
Proceedings of the 2015 IEEE Information Theory Workshop, 2015

Zero error coordination.
Proceedings of the 2015 IEEE Information Theory Workshop, 2015

Coding against a limited-view adversary: The effect of causality and feedback.
Proceedings of the IEEE International Symposium on Information Theory, 2015

Generalized belief propagation for estimating the partition function of the 2D Ising model.
Proceedings of the IEEE International Symposium on Information Theory, 2015

Reliable and secure communication over adversarial multipath networks: A survey.
Proceedings of the 10th International Conference on Information, 2015

2014
Network Codes Resilient to Jamming and Eavesdropping.
IEEE/ACM Trans. Netw., 2014

Non-Adaptive Group Testing: Explicit Bounds and Novel Algorithms.
IEEE Trans. Inf. Theory, 2014

Non-Adaptive Group Testing with Inhibitors.
CoRR, 2014

SUPER: Sparse signals with Unknown Phases Efficiently Recovered.
CoRR, 2014

Reliable, deniable and hidable communication: A quick survey.
Proceedings of the 2014 IEEE Information Theory Workshop, 2014

Reliable deniable communication with channel uncertainty.
Proceedings of the 2014 IEEE Information Theory Workshop, 2014

Reliable, deniable and hidable communication.
Proceedings of the 2014 Information Theory and Applications Workshop, 2014

Group testing with prior statistics.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Reliable, deniable, and hidable communication over multipath networks.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

SUPER: Sparse signals with unknown phases efficiently recovered.
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.
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.
IEEE Trans. Inf. Theory, 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

Inter-Session Network Coding with Strategic Users: A Game-Theoretic Analysis of the Butterfly Network.
IEEE Trans. Commun., 2013

Near-Optimal Stochastic Threshold Group Testing
CoRR, 2013

Routing for Security in Networks with Adversarial Nodes
CoRR, 2013

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

Routing for security in networks with adversarial nodes.
Proceedings of the International Symposium on Network Coding, 2013

Stochastic threshold group testing.
Proceedings of the 2013 IEEE Information Theory Workshop, 2013

On AVCs with quadratic constraints.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

Reliable deniable communication: Hiding messages in noise.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

Rateless resilient network coding against byzantine adversaries.
Proceedings of the IEEE INFOCOM 2013, Turin, Italy, April 14-19, 2013, 2013

GROTESQUE: Noisy Group Testing (Quick and Efficient).
Proceedings of the 51st Annual Allerton Conference on Communication, 2013

2012
Passive Network Tomography for Erroneous Networks: A Network Coding Approach.
IEEE Trans. Inf. Theory, 2012

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

Analog Network Coding in General SNR Regime: Performance of Network Simplification
CoRR, 2012

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

Secure Compressed Reading in Smart Grids
CoRR, 2012

Analog Network Coding in General SNR Regime
CoRR, 2012

Analog network coding in general SNR regime: Performance of a greedy scheme.
Proceedings of the International Symposium on Network Coding, 2012

Analog network coding in general SNR regime: Performance of network simplification.
Proceedings of the 2012 IEEE Information Theory Workshop, 2012

On erasure correction coding for streaming.
Proceedings of the 2012 Information Theory and Applications Workshop, 2012

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

Analog network coding in general SNR regime.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

2011
Multiple-Access Network Information-Flow and Correction Codes.
IEEE Trans. Inf. Theory, 2011

Amplify-and-Forward in Wireless Relay Networks
CoRR, 2011

Low-Complexity Near-Optimal Codes for Gaussian Relay Networks
CoRR, 2011

Binary error correcting network codes.
Proceedings of the 2011 IEEE Information Theory Workshop, 2011

Amplify-and-forward in wireless relay networks.
Proceedings of the 2011 IEEE Information Theory Workshop, 2011

Delay invariant convolutional network codes.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Beyond the cut-set bound: Uncertainty computations in network coding with correlated sources.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Universal and robust distributed network codes.
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.
Proceedings of the 49th Annual Allerton Conference on Communication, 2011

2010
Multiple Access Network Information-flow And Correction codes
CoRR, 2010

Multi-source operator channels: Efficient capacity-achieving codes.
Proceedings of the 2010 IEEE Information Theory Workshop, 2010

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

Concatenated Polar codes.
Proceedings of the IEEE International Symposium on Information Theory, 2010

Network Coding Tomography for Network Failures.
Proceedings of the INFOCOM 2010. 29th IEEE International Conference on Computer Communications, 2010

RIPPLE Authentication for Network Coding.
Proceedings of the INFOCOM 2010. 29th IEEE International Conference on Computer Communications, 2010

2009
Network coding tomography for network failures
CoRR, 2009

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

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

To code or not to code: Rate optimality in node-capacitated networks.
Proceedings of the IEEE International Symposium on Information Theory, 2009

A Game-Theoretic Analysis of Inter-Session Network Coding.
Proceedings of IEEE International Conference on Communications, 2009

Codes against online adversaries.
Proceedings of the 47th Annual Allerton Conference on Communication, 2009

2008
Resilient Network Coding in the Presence of Byzantine Adversaries.
IEEE Trans. Inf. Theory, 2008

Network coding.
J. Commun. Networks, 2008

"Real" Slepian-Wolf Codes
CoRR, 2008

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

2007
Resilient network codes in the presence of eavesdropping Byzantine adversaries.
Proceedings of the IEEE International Symposium on Information Theory, 2007

Resilient Network Coding in the Presence of Byzantine Adversaries.
Proceedings of the INFOCOM 2007. 26th IEEE International Conference on Computer Communications, 2007

Distributed Functional Compression through Graph Coloring.
Proceedings of the 2007 Data Compression Conference (DCC 2007), 2007

2006
Low Complexity Encoding for Network Codes.
Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

2005
Polynomial time algorithms for multicast network code construction.
IEEE Trans. Inf. Theory, 2005

Correction of adversarial errors in networks.
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

2004
Communication and distributional complexity of joint probability mass functions.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004


  Loading...