# Michelle Effros

According to our database1, Michelle Effros authored at least 180 papers between 1993 and 2021.

Collaborative distances:
• Dijkstra number2 of four.
• Erdős number3 of two.

## IEEE Fellow

IEEE Fellow 2009, "For contributions to source and network coding".

Book
In proceedings
Article
PhD thesis
Other

## Bibliography

2021
Every Bit Counts: Second-Order Analysis of Cooperation in the Multiple-Access Channel.
CoRR, 2021

Beyond Capacity: The Joint Time-Rate Region.
CoRR, 2021

2020
The Edge-Removal Problem's Connections to the Zero-Error and $\delta$ -Dependence Problems in Network Coding.
IEEE Trans. Inf. Theory, 2020

Lossless Source Coding in the Point-to-Point, Multiple Access, and Random Access Scenarios.
IEEE Trans. Inf. Theory, 2020

Edge removal in undirected networks.
CoRR, 2020

Towards an Operational Definition of Group Network Codes.
CoRR, 2020

Gaussian Multiple and Random Access in the Finite Blocklength Regime.
Proceedings of the IEEE International Symposium on Information Theory, 2020

Finite-Blocklength and Error-Exponent Analyses for LDPC Codes in Point-to-Point and Multiple Access Communication.
Proceedings of the IEEE International Symposium on Information Theory, 2020

2019
Negligible Cooperation: Contrasting the Maximal- and Average-Error Cases.
CoRR, 2019

Universal Mutual Information Privacy Guarantees for Smart Meters.
CoRR, 2019

A Local Perspective on the Edge Removal Problem.
Proceedings of the IEEE International Symposium on Information Theory, 2019

Secure Network Coding in the Setting in Which a Non-Source Node May Generate Random Keys.
Proceedings of the IEEE International Symposium on Information Theory, 2019

Universal Privacy Guarantees for Smart Meters.
Proceedings of the IEEE International Symposium on Information Theory, 2019

2018
Can Negligible Rate Increase Network Reliability?
IEEE Trans. Inf. Theory, 2018

The Unbounded Benefit of Encoder Cooperation for the $k$ -User MAC.
IEEE Trans. Inf. Theory, 2018

Can Negligible Cooperation Increase Network Capacity? The Average-Error Case.
CoRR, 2018

Can Negligihle Cooperation Increase Capacity? The Average-Error Case.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

Random Access Channel Coding in the Finite Blocklength Regime.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

2017
A code equivalence between streaming network coding and streaming index coding.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

The birthday problem and zero-error list codes.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

The benefit of encoder cooperation in the presence of state information.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

2016
The Unbounded Benefit of Encoder Cooperation for the $k$-User MAC (Extended Version).
CoRR, 2016

Can Negligible Cooperation Increase Network Reliability? (Extended Version).
CoRR, 2016

On tightness of an entropic region outer bound for network coding and the edge removal property.
Proceedings of the IEEE International Symposium on Information Theory, 2016

Can negligible cooperation increase network reliability?
Proceedings of the IEEE International Symposium on Information Theory, 2016

A characterization of the capacity region for network coding with dependent sources.
Proceedings of the IEEE International Symposium on Information Theory, 2016

On the Capacity Advantage of a Single Bit.
Proceedings of the 2016 IEEE Globecom Workshops, Washington, DC, USA, December 4-8, 2016, 2016

2015
Separation of Source-Network Coding and Channel Coding in Wireline Networks.
IEEE Trans. Inf. Theory, 2015

An Equivalence Between Network Coding and Index Coding.
IEEE Trans. Inf. Theory, 2015

The Multivariate Covering Lemma and its Converse.
CoRR, 2015

On the Cost and Benefit of Cooperation (Extended Version).
CoRR, 2015

A Perspective on Future Research Directions in Information Theory.
CoRR, 2015

On the fundamental limits of caching in combination networks.
Proceedings of the 16th IEEE International Workshop on Signal Processing Advances in Wireless Communications, 2015

On an equivalence of the reduction of k-unicast to 2-unicast capacity and the edge removal property.
Proceedings of the IEEE International Symposium on Information Theory, 2015

On the cost and benefit of cooperation.
Proceedings of the IEEE International Symposium on Information Theory, 2015

2014
A Theory of Network Equivalence - Part II: Multiterminal Channels.
IEEE Trans. Inf. Theory, 2014

On the Delay Advantage of Coding in Packet Erasure Networks.
IEEE Trans. Inf. Theory, 2014

On the Power of Cooperation: Can a Little Help a Lot? (Extended Version).
CoRR, 2014

Is there a canonical network for network information theory?
Proceedings of the 2014 IEEE Information Theory Workshop, 2014

Linear capacity equivalence between multiple multicast and multiple unicast.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

On the power of cooperation: Can a little help a lot?
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Efficient pooling against strategic adversary with applications in anonymous and reliable networking.
Proceedings of the 52nd Annual Allerton Conference on Communication, 2014

2013
Multi-Resolution Video Streaming in Peer-to-peer Networks
CoRR, 2013

Zero vs. epsilon Error in Interference Channels.
CoRR, 2013

Zero vs. ε error in interference channels.
Proceedings of the 2013 IEEE Information Theory Workshop, 2013

Outer bounds and a functional study of the edge removal problem.
Proceedings of the 2013 IEEE Information Theory Workshop, 2013

Capacity region of multi-resolution streaming in peer-to-peer networks.
Proceedings of the 2013 IEEE Information Theory Workshop, 2013

On a capacity equivalence between network and index coding and the edge removal problem.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

On a capacity equivalence between multiple multicast and multiple unicast.
Proceedings of the 51st Annual Allerton Conference on Communication, 2013

2012
The Price of Selfishness in Network Coding.
IEEE Trans. Inf. Theory, 2012

On dependence and delay: Capacity bounds for wireless networks.
Proceedings of the 2012 IEEE Wireless Communications and Networking Conference, 2012

Source coding for dependent sources.
Proceedings of the 2012 IEEE Information Theory Workshop, 2012

On network coding capacity under on-off scheduling.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

Network equivalence in the presence of an eavesdropper.
Proceedings of the 50th Annual Allerton Conference on Communication, 2012

Peer-to-peer anonymous networking using coding.
Proceedings of the 50th Annual Allerton Conference on Communication, 2012

2011
A Theory of Network Equivalence - Part I: Point-to-Point Channels.
IEEE Trans. Inf. Theory, 2011

Network Error Correction With Unequal Link Capacities.
IEEE Trans. Inf. Theory, 2011

Near Optimality of Composite Multiple Description Source Codes.
IEEE Trans. Inf. Theory, 2011

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

Beyond Shannon: the quest for fundamental performance limits of wireless ad hoc networks.
IEEE Commun. Mag., 2011

Equivalent models for multi-terminal channels.
Proceedings of the 2011 IEEE Information Theory Workshop, 2011

On the impact of a single edge on the network coding capacity.
Proceedings of the Information Theory and Applications Workshop, 2011

On network error correction with limited feedback capacity.
Proceedings of the Information Theory and Applications Workshop, 2011

On the equivalence of Shannon capacity and stable capacity in networks with memoryless channels.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

On distortion bounds for dependent sources over wireless networks.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

A strong converse in source coding for super-source networks.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

On equivalence for networks of noisy channels under byzantine attacks.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

On capacity bounds for networks containing two-way channels.
Proceedings of the 49th Annual Allerton Conference on Communication, 2011

Network coding: Is zero error always possible?
Proceedings of the 49th Annual Allerton Conference on Communication, 2011

On sources and networks: Can computational tools derive information theoretic limits?
Proceedings of the 49th Annual Allerton Conference on Communication, 2011

2010
Generalizing capacity: new definitions and capacity theorems for composite channels.
IEEE Trans. Inf. Theory, 2010

Functional compression through graph coloring.
IEEE Trans. Inf. Theory, 2010

Compressive Sensing Over Networks
CoRR, 2010

On Equivalence Between Network Topologies
CoRR, 2010

New results on network error correction: Capacities and upper bounds.
Proceedings of the Information Theory and Applications Workshop, 2010

On capacity outer bounds for a simple family of wireless networks.
Proceedings of the Information Theory and Applications Workshop, 2010

On the separation of lossy source-network coding and channel coding in wireline networks.
Proceedings of the IEEE International Symposium on Information Theory, 2010

Capacity bounds for networks of broadcast channels.
Proceedings of the IEEE International Symposium on Information Theory, 2010

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

On zero-error source coding with feedback.
Proceedings of the IEEE International Symposium on Information Theory, 2010

Optimal reverse carpooling over wireless networks - a distributed optimization approach.
Proceedings of the 44th Annual Conference on Information Sciences and Systems, 2010

2009
On lossless coding with coded side information.
IEEE Trans. Inf. Theory, 2009

Source-Channel Coding and Separation for Generalized Communication Systems
CoRR, 2009

A game theoretic approach to network coding.
Proceedings of the 2009 IEEE Information Theory Workshop, 2009

On a theory of network equivalence.
Proceedings of the 2009 IEEE Information Theory Workshop, 2009

Rate rRegions for coherent and noncoherent multisource network error correction.
Proceedings of the IEEE International Symposium on Information Theory, 2009

A strong converse for a collection of network source coding problems.
Proceedings of the IEEE International Symposium on Information Theory, 2009

On the delay of network coding over line networks.
Proceedings of the IEEE International Symposium on Information Theory, 2009

On networks with side information.
Proceedings of the IEEE International Symposium on Information Theory, 2009

On feedback in network source coding.
Proceedings of the IEEE International Symposium on Information Theory, 2009

2008
IEEE Trans. Inf. Theory, 2008

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

Byzantine Modification Detection in Multicast Networks With Random Network Coding.
IEEE Trans. Inf. Theory, 2008

On coding for reliable communication over packet networks.
Phys. Commun., 2008

On approximating the rate regions for lossy source coding with coded and uncoded side information.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

On achievable rates for multicast in the presence of side information.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

Generalized Capacity and Source-Channel Coding for Packet Erasure Channels.
Proceedings of the Global Communications Conference, 2008. GLOBECOM 2008, New Orleans, LA, USA, 30 November, 2008

2007
A Practical Scheme for Wireless Network Operation.
IEEE Trans. Commun., 2007

On Source Coding with Coded Side Information for a Binary Source with Binary Side Information.
Proceedings of the IEEE International Symposium on Information Theory, 2007

Capacity Definitions of General Channels with Receiver Side Information.
Proceedings of the IEEE International Symposium on Information Theory, 2007

Network Source Coding: Pipe Dream or Promise?
Proceedings of the IEEE International Symposium on Information Theory, 2007

On Network Coding of Independent and Dependent Sources in Line Networks.
Proceedings of the IEEE International Symposium on Information Theory, 2007

Evolutionary Approaches To Minimizing Network Coding Resources.
Proceedings of the INFOCOM 2007. 26th IEEE International Conference on Computer Communications, 2007

Optimal Strategies for Efficient Peer-to-Peer File Sharing.
Proceedings of the IEEE International Conference on Acoustics, 2007

2006
Introduction to the special issue on networking and information theory.
IEEE/ACM Trans. Netw., 2006

Separating distributed source coding from network coding.
IEEE Trans. Inf. Theory, 2006

A Random Linear Network Coding Approach to Multicast.
IEEE Trans. Inf. Theory, 2006

On rate-distortion with mixed types of side information.
IEEE Trans. Inf. Theory, 2006

Capacity of wireless erasure networks.
IEEE Trans. Inf. Theory, 2006

Low-Complexity Approaches to Slepian-Wolf Near-Lossless Distributed Data Compression.
IEEE Trans. Inf. Theory, 2006

On Separation, Randomness and Linearity for Network Codes over Finite Fields
CoRR, 2006

A Partial Solution for Lossless Source Coding with Coded Side Information.
Proceedings of the 2006 IEEE Information Theory Workshop, 2006

A Tiling Approach to Network Code Design for Wireless Networks.
Proceedings of the 2006 IEEE Information Theory Workshop, 2006

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

On the Concavity of Rate Regions for Lossless Source Coding in Networks.
Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

On Mult-iResolution Coding and a Two-Hop Network.
Proceedings of the 2006 Data Compression Conference (DCC 2006), 2006

Time-Sharing Vs. Source-Splitting in the Slepian-Wolf Problem: Error Exponents Analysis.
Proceedings of the 2006 Data Compression Conference (DCC 2006), 2006

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

On the rate loss of multiple description source codes.
IEEE Trans. Inf. Theory, 2005

Interference management via capacity-achieving codes for the deterministic broadcast channel.
Proceedings of the IEEE ITSOC Information Theory Workshop 2005 on Coding and Complexity, 2005

Further results on coding for reliable communication over packet networks.
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

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

Source coding for a simple multi-hop network.
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

On the rate loss and construction of source codes for broadcast channels.
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

Rate-splitting for the deterministic broadcast channel.
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

Towards bridging the gap between theory and practice for the Slepian-Wolf problem.
Proceedings of the 2005 IEEE International Conference on Acoustics, 2005

Source Coding for a Multihop Network.
Proceedings of the 2005 Data Compression Conference (DCC 2005), 2005

Towards Practical Minimum-Entropy Universal Decoding.
Proceedings of the 2005 Data Compression Conference (DCC 2005), 2005

2004
Network Vector Quantization.
IEEE Trans. Inf. Theory, 2004

Suboptimality of the Karhunen-Loève Transform for Transform Coding.
IEEE Trans. Inf. Theory, 2004

Multiresolution vector quantization.
IEEE Trans. Inf. Theory, 2004

Deterministic clustering with data nets
Electron. Colloquium Comput. Complex., 2004

On source and channel codes for multiple inputs and outputs: does multiple description beat space time?
Proceedings of the 2004 IEEE Information Theory Workshop, 2004

Uniquely decodable multiple access source codes.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

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

Byzantine modification detection in multicast networks using randomized network coding.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

On the capacity of wireless erasure networks.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

Rapid near-optimal VQ design with a deterministic data net.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

A new source-splitting approach to the slepian-wolf problem.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

Multi-resolution Source Coding Using Entropy Constrained Dithered Scalar Quantization.
Proceedings of the 2004 Data Compression Conference (DCC 2004), 2004

On Some New Approaches to Practical Slepian-Wolf Compression Inspired by Channel Coding.
Proceedings of the 2004 Data Compression Conference (DCC 2004), 2004

2003
Lossless and near-lossless source coding for multiple access networks.
IEEE Trans. Inf. Theory, 2003

Improved bounds for the rate loss of multiresolution source codes.
IEEE Trans. Inf. Theory, 2003

Linear Network Codes: A Unified Framework for Source, Channel, and Network Coding.
Proceedings of the Advances in Network Information Theory, 2003

Low Complexity Code Design for Lossless and Near-Lossless Side Information Source Codes.
Proceedings of the 2003 Data Compression Conference (DCC 2003), 2003

Network Source Coding Using Entropy Constrained Dithered Quantization.
Proceedings of the 2003 Data Compression Conference (DCC 2003), 2003

Suboptimality of the Karhuenen-Loève Transform for Transform Coding.
Proceedings of the 2003 Data Compression Conference (DCC 2003), 2003

2002
Universal lossless source coding with the Burrows Wheeler Transform.
IEEE Trans. Inf. Theory, 2002

On the rate-distortion performance and computational efficiency of the Karhunen-Loeve transform for lossy data compression.
IEEE Trans. Image Process., 2002

Quantization as Histogram Segmentation: Globally Optimal Scalar Quantizer Design in Network System.
Proceedings of the 2002 Data Compression Conference (DCC 2002), 2002

Codecell Contiguity in Optimal Fixed-Rate and Entropy-Constrained Network Scalar Quantizers.
Proceedings of the 2002 Data Compression Conference (DCC 2002), 2002

2001
The capacity region of broadcast channels with intersymbol interference and colored Gaussian noise.
IEEE Trans. Inf. Theory, 2001

Universal multiresolution source codes.
IEEE Trans. Inf. Theory, 2001

Optimal Code Design for Lossless and Near Lossless Source Coding in Multiple Access Networks.
Proceedings of the Data Compression Conference, 2001

Network Vector Quantization.
Proceedings of the Data Compression Conference, 2001

2000
Joint design of vector quantizers and RCPC channel codes for Rayleigh fading channels.
Proceedings of the Global Telecommunications Conference, 2000. GLOBECOM 2000, San Francisco, CA, USA, 27 November, 2000

Lossless and Lossy Broadcast System Source Codes: Theoretical Limits, Optimal Design, and Empirical Performance.
Proceedings of the Data Compression Conference, 2000

Multi-Resolution Adaptation of the SPIHT Algorithm for Multiple Description.
Proceedings of the Data Compression Conference, 2000

PPM Performance with BWT Complexity: A New Method for Lossless Data Compression.
Proceedings of the Data Compression Conference, 2000

1999
Distortion-rate bounds for fixed- and variable-rate multiresolution source codes.
IEEE Trans. Inf. Theory, 1999

Weighted universal image compression.
IEEE Trans. Image Process., 1999

Separable Karhunen Loeve transforms for the weighted universal transform coding algorithm.
Proceedings of the 1999 IEEE International Conference on Acoustics, 1999

Generalized Multiple Description Vector Quantization.
Proceedings of the Data Compression Conference, 1999

Universal Lossless Source Coding with the Burrows Wheeler Transform.
Proceedings of the Data Compression Conference, 1999

1998
Joint design of fixed-rate source codes and multiresolution channel codes.
IEEE Trans. Commun., 1998

Optimal modeling for complex system design [data compression].
IEEE Signal Process. Mag., 1998

Practical Multi-Resolution Source Coding: TSVQ Revisited.
Proceedings of the Data Compression Conference, 1998

1997
Zerotree Design for Image Compression: Toward Weighted Universal Zerotree Coding.
Proceedings of the Proceedings 1997 International Conference on Image Processing, 1997

Iterative Joint Design of Source Codes and Multiresolution Channel Codes.
Proceedings of the 1997 IEEE International Conference on Communications: Towards the Knowledge Millennium, 1997

Robustness to channel variation in source coding for transmission across noisy channels.
Proceedings of the 1997 IEEE International Conference on Acoustics, 1997

Conditional weighted universal source codes: second order statistics in universal coding.
Proceedings of the 1997 IEEE International Conference on Acoustics, 1997

Fast Weighted Universal Transform Coding: Toward Optimal, Low Complexity Bases for Image Compression.
Proceedings of the 7th Data Compression Conference (DCC '97), 1997

1996
A vector quantization approach to universal noiseless coding and quantization.
IEEE Trans. Inf. Theory, 1996

1995
Weighted universal transform coding: universal image compression with the Karhunen-Loeve transform.
Proceedings of the Proceedings 1995 International Conference on Image Processing, 1995

Weighted universal bit allocation: optimal multiple quantization matrix coding.
Proceedings of the 1995 International Conference on Acoustics, 1995

1994
A progressive universal noiseless coder.
IEEE Trans. Inf. Theory, 1994

Variable-rate source coding theorems for stationary nonergodic sources.
IEEE Trans. Inf. Theory, 1994