- Statistical Pruning for Near Maximum Likelihood Detection of MIMO Systems
- Comparison of Network Coding and Non-Network Coding Schemes for Multi-hop Wireless Networks
- Symmetric Allocations for Distributed Storage Derek Leong
- ISIT 2003, Yokohama, Japan, June 29 July 4, 2003 Network Coding from a Network Flow Perspective
- Achievable Strategies for General Secure Network Coding
- IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 51, NO. 4, APRIL 2005 1295 An Information-Theoretic View of
- Multiple-access Network Information-flow and Correction Codes
- 2608 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 52, NO. 6, JUNE 2006 Minimum-Cost Multicast Over Coded
- Outer bounds on the error correction capacity region for non-multicast networks
- On Secure Network Coding with Unequal Link Capacities and Restricted Wiretapping Sets
- On the Delay Advantage of Coding in Packet Erasure Networks
- 2010 IEEE Information Theory Workshop -ITW 2010 Dublin Multi-source operator channels: Efficient
- Network error correction with unequal link capacities Sukwon Kim, Tracey Ho, Michelle Effros, and Salman Avestimehr
- Rate Regions for Coherent and Noncoherent Multisource Network Error Correction
- On Noncoherent Correction of Network Errors and Erasures with Random Locations
- On the Delay of Network Coding over Line Networks
- On Multiple Access Random Medium Access Tao Cui and Tracey Ho
- Achievable Rate and Optimal Physical Layer Rate Allocation in Interference-Free Wireless Networks
- Distributed Asynchronous Algorithms for Multicast Network Coding
- On Randomized Network Coding , Muriel Medard
- On Coding for Non-Multicast Networks Muriel Medard Michelle Effros David Karger Tracey Ho
- ISIT 2003, Yokohama, Japan, June 29 July 4, 2003 The Benefits of Coding over Routing in a Randomized Setting
- The Benefits of Coding over Routing in a Randomized Setting
- Network Coding from a Network Flow Perspective Tracey Ho, David R. Karger, Muriel Medard and Ralf Koetter
- On Equivalence Between Network Topologies Department of Electrical Engineering
- Resilient Network Coding in the Presence of Byzantine Adversaries
- Network With Costs: Timing and Flow Decomposition
- DIMACS Series in Discrete Mathematics and Theoretical Computer Science
- Byzantine Modification Detection in Multicast Networks using Randomized Network Coding
- On combining information-theoretic and cryptographic approaches to network coding
- Correction of Adversarial Errors in Networks Sidharth Jaggi, Michael Langberg, Tracey Ho, and Michelle Effros
- Optimization Based Rate Control for Multicast with Network Coding
- Opportunistic Source Coding for Data Gathering in Wireless Sensor Networks
- International Symposium on Information Theory and its Applications, ISITA2004 Parma, Italy, October 1013, 2004
- 2006 IEEE Information Theory Workshop, Punta del Este, Uruguay, March 13-17, 2006 A Tiling Approach to Network Code Design
- On network coding and routing in dynamic wireless multicast networks
- Mobilized ad-hoc networks: A reinforcement learning approach
- Dynamic Algorithms for Multicast with Intra-session Network Coding
- Network Coding for Correlated Sources Tracey Ho, Muriel Medard, Michelle Effros and Ralf Koetter
- Byzantine Modification Detection in Multicast Networks using Randomized Network Coding
- An information theoretic view of network Tracey Ho, Muriel Medard and Ralf Koetter
- On Linear Network Coding Sidharth Jaggi, Michelle Effros
- Networking from a network coding perspective Submitted to the Department of Electrical Engineering and Computer
- Network error correction with unequal link Sukwon Kim, Tracey Ho, Member, IEEE, Michelle Effros, Fellow, IEEE, Amir Salman
- On network error correction with limited feedback Tracey Ho, Sukwon Kim, Yanbo Yang, Michelle Effros and Salman Avestimehr
- On Equivalence for Networks of Noisy Channels under Byzantine Attacks
- Network RS codes for Efficient Network Adversary Localization
- On the Equivalence of Shannon Capacity and Stable Capacity in Networks with Memoryless Channels
- Error Estimating Codes with Constant Overhead: A Random Walk Approach
