| Publication | Date of Publication | Type |
|---|
Random linear streaming codes analyses. II: Asymptotics
IEEE Transactions on Information Theory | 2026-03-18 | Paper |
Channel capacity for adversaries with computationally bounded observations
IEEE Transactions on Information Theory | 2024-07-21 | Paper |
On the optimal delay growth rate of multi-hop line networks: asymptotically delay-optimal designs and the corresponding error exponents
IEEE Transactions on Information Theory | 2024-07-19 | Paper |
Optimal single-bit relaying strategies with multi-relay diversity
IEEE Transactions on Information Theory | 2024-07-19 | Paper |
Random Linear Streaming Codes in the Finite Memory Length and Decoding Deadline Regime—Part I: Exact Analysis
IEEE Transactions on Information Theory | 2024-03-14 | Paper |
Coded Caching With Full Heterogeneity: Exact Capacity of the Two-User/Two-File Case
IEEE Transactions on Information Theory | 2024-03-14 | Paper |
A New Capacity-Approaching Scheme for General 1-to-K Broadcast Packet Erasure Channels With ACK/NACK
IEEE Transactions on Information Theory | 2020-09-29 | Paper |
The Two-Unicast Problem
IEEE Transactions on Information Theory | 2018-09-14 | Paper |
Locally Repairable Regenerating Codes: Node Unavailability and the Insufficiency of Stationary Local Repair
IEEE Transactions on Information Theory | 2018-09-14 | Paper |
When Can Intelligent Helper Node Selection Improve the Performance of Distributed Storage Networks?
IEEE Transactions on Information Theory | 2018-06-27 | Paper |
Finding All Small Error-Prone Substructures in LDPC Codes
IEEE Transactions on Information Theory | 2017-08-08 | Paper |
Pruning Network Coding Traffic by Network Coding—A New Class of Max-Flow Algorithms
IEEE Transactions on Information Theory | 2017-07-27 | Paper |
Pairwise Intersession Network Coding on Directed Networks
IEEE Transactions on Information Theory | 2017-07-27 | Paper |
On the Capacity of 1-to-$K$ Broadcast Packet Erasure Channels With Channel Output Feedback
IEEE Transactions on Information Theory | 2017-07-12 | Paper |
Bandit problems with side observations
IEEE Transactions on Automatic Control | 2017-07-12 | Paper |
On the Capacity of Wireless 1-Hop Intersession Network Coding—A Broadcast Packet Erasure Channel Approach
IEEE Transactions on Information Theory | 2017-07-12 | Paper |
The Capacity Region of Two-Receiver Multiple-Input Broadcast Packet Erasure Channels With Channel Output Feedback
IEEE Transactions on Information Theory | 2017-05-16 | Paper |
Sending Perishable Information: Coding Improves Delay-Constrained Throughput Even for Single Unicast
IEEE Transactions on Information Theory | 2017-05-02 | Paper |
General Capacity Region for the Fully Connected Three-Node Packet Erasure Network
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
Density Evolution for Asymmetric Memoryless Channels
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Finite-Dimensional Bounds on ${\BBZ}_m$ and Binary LDPC Codes With Belief Propagation Decoders
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Arbitrary side observations in bandit problems
Advances in Applied Mathematics | 2005-08-01 | Paper |
