| Publication | Date of Publication | Type |
|---|
Hypothesis testing for adversarial channels: Chernoff-Stein exponents
IEEE Transactions on Information Theory | 2026-07-07 | Paper |
Identification over permutation channels
IEEE Transactions on Information Theory | 2025-10-06 | Paper |
Byzantine multiple access channels. II: Communication with adversary identification
IEEE Transactions on Information Theory | 2025-02-26 | Paper |
Codes for adversaries: between worst-case and average-case jamming
Foundations and Trends in Communications and Information Theory | 2025-01-29 | Paper |
Byzantine multiple access channels. I: Reliable communication
IEEE Transactions on Information Theory | 2024-07-22 | Paper |
Fundamental Limits of Demand-Private Coded Caching
IEEE Transactions on Information Theory | 2022-07-13 | Paper |
Private Index Coding
IEEE Transactions on Information Theory | 2022-05-30 | Paper |
Sufficiently Myopic Adversaries Are Blind
IEEE Transactions on Information Theory | 2020-01-28 | Paper |
Function Computation Through a Bidirectional Relay
IEEE Transactions on Information Theory | 2019-01-28 | Paper |
An MMSE Strategy at Relays With Partial CSI for a Multi-Layer Relay Network
IEEE Transactions on Signal Processing | 2018-08-22 | Paper |
Communication in the Presence of a State-Aware Adversary
IEEE Transactions on Information Theory | 2018-06-27 | Paper |
Wiretapped Oblivious Transfer
IEEE Transactions on Information Theory | 2017-07-27 | Paper |
A Channel Coding Perspective of Collaborative Filtering
IEEE Transactions on Information Theory | 2017-07-27 | Paper |
On Network Coding for Sum-Networks
IEEE Transactions on Information Theory | 2017-07-12 | Paper |
Upper Bounds on the Capacity of Binary Channels With Causal Adversaries
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
Distributed Rate Adaptation and Power Control in Fading Multiple Access Channels
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
Estimating network link characteristics using packet-pair dispersion: a discrete-time queueing theoretic analysis
Computer Networks | 2011-04-27 | Paper |
On Existence of Good Self-Dual Quasi-Cyclic Codes
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Affine Invariant Extended Cyclic Codes Over Galois Rings
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
\(\mathbb F_q\)-linear cyclic codes over \(\mathbb F_{q^m}\): DFT approach
Designs, Codes and Cryptography | 2005-02-28 | Paper |
Codes Closed under Arbitrary Abelian Group of Permutations
SIAM Journal on Discrete Mathematics | 2005-02-28 | Paper |
Codes Closed under Arbitrary Abelian Group of Permutations
SIAM Journal on Discrete Mathematics | 2005-02-28 | Paper |
\({\mathbb F}_{q}\)-linear cyclic codes over \({\mathbb F}_q\): DFT characterization
Lecture Notes in Computer Science | 2004-08-04 | Paper |
DFT domain characterization of quasi-cyclic codes
Applicable Algebra in Engineering, Communication and Computing | 2003-07-08 | Paper |
