| Publication | Date of Publication | Type |
|---|
Codes for adversaries: between worst-case and average-case jamming
Foundations and Trends in Communications and Information Theory | 2025-01-29 | Paper |
Generalized Group Testing
IEEE Transactions on Information Theory | 2024-03-19 | Paper |
scientific article; zbMATH DE number 7650399 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-03 | Paper |
Quadratically Constrained Myopic Adversarial Channels
IEEE Transactions on Information Theory | 2022-08-19 | Paper |
Covert Communication Over Adversarially Jammed Channels
IEEE Transactions on Information Theory | 2021-09-07 | Paper |
Covert Communication With Polynomial Computational Complexity
IEEE Transactions on Information Theory | 2020-09-29 | Paper |
| Tight List-Sizes for Oblivious AVCs under Constraints | 2020-09-08 | Paper |
Sufficiently Myopic Adversaries Are Blind
IEEE Transactions on Information Theory | 2020-01-28 | Paper |
Generalized List Decoding
(available as arXiv preprint) | 2019-09-09 | Paper |
The Capacity of Online (Causal) q -Ary Error-Erasure Channels
IEEE Transactions on Information Theory | 2019-07-19 | Paper |
Nearly Optimal Sparse Group Testing
IEEE Transactions on Information Theory | 2019-07-19 | Paper |
End-to-End Error-Correcting Codes on Networks With Worst-Case Bit Errors
IEEE Transactions on Information Theory | 2018-09-14 | Paper |
Learning Immune-Defectives Graph through Group Tests
(available as arXiv preprint) | 2017-08-25 | Paper |
Efficient Algorithms for Noisy Group Testing
IEEE Transactions on Information Theory | 2017-07-27 | Paper |
Multiple-Access Network Information-Flow and Correction Codes
IEEE Transactions on Information Theory | 2017-07-27 | Paper |
Beyond the Cut-Set Bound: Uncertainty Computations in Network Coding With Correlated Sources
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
Passive Network Tomography for Erroneous Networks: A Network Coding Approach
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
Upper Bounds on the Capacity of Binary Channels With Causal Adversaries
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
Non-Adaptive Group Testing: Explicit Bounds and Novel Algorithms
IEEE Transactions on Information Theory | 2017-05-16 | Paper |
SHO-FA: Robust Compressive Sensing With Order-Optimal Complexity, Measurements, and Bits
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
A characterization of the capacity of online (causal) binary channels
Proceedings of the forty-seventh annual ACM symposium on Theory of Computing | 2015-08-21 | Paper |
Resilient Network Coding in the Presence of Byzantine Adversaries
IEEE Transactions on Information Theory | 2009-02-24 | Paper |
