Michelle Effros

IEEE Trans. Inf. Theory, September, 2024

Variable-Length Sparse Feedback Codes for Point-to-Point, Multiple Access, and Random Access Channels.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, April, 2024

Characterizing positive-rate key-cast (and multicast network coding) with eavesdropping nodes.

[BibT_eX]

[DOI]

CoRR, 2024

Characterizing positive-rate secure multicast network coding with eavesdropping nodes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2024

Nobody Expects a Differential Equation: Minimum Energy-Per-Bit for the Gaussian Relay Channel with Rank-1 Linear Relaying.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2024

Asynchronous Random Access Data Compression.

[BibT_eX]

[DOI]

Siming Sun

Proceedings of the Data Compression Conference, 2024

Almost Lossless Onion Peeling Data Compression.

[BibT_eX]

[DOI]

Siming Sun

Proceedings of the Data Compression Conference, 2024

2023

Multiple Key-cast over Networks.

[BibT_eX]

[DOI]

CoRR, 2023

Perfect vs. Independent Feedback in the Multiple-Access Channel.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2023

2022

OUTformation: Distributed Data-Gathering with Feedback under Unknown Environment and Communication Delay Constraints.

[BibT_eX]

[DOI]

SooJean Han

Richard M. Murray

CoRR, 2022

Network Coding Multicast Key-Capacity.

[BibT_eX]

[DOI]

Proceedings of the IEEE Information Theory Workshop, 2022

Third-order Analysis of Channel Coding in the Moderate Deviations Regime.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2022

Source Coding with Unreliable Side Information in the Finite Blocklength Regime.

[BibT_eX]

[DOI]

Siming Sun

Proceedings of the IEEE International Symposium on Information Theory, 2022

On the Benefit of Cooperation in Relay Networks.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2022

2021

Gaussian Multiple and Random Access Channels: Finite-Blocklength Analysis.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2021

Random Access Channel Coding in the Finite Blocklength Regime.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2021

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

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2021

The Birthday Problem and Zero-Error List Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2021

Beyond Capacity: The Joint Time-Rate Region.

[BibT_eX]

[DOI]

CoRR, 2021

Nested Sparse Feedback Codes for Point-to-Point, Multiple Access, and Random Access Channels.

[BibT_eX]

[DOI]

Proceedings of the IEEE Information Theory Workshop, 2021

Variable-length Feedback Codes with Several Decoding Times for the Gaussian Channel.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2021

Nested LDPC Codes for Random Access Communication.

[BibT_eX]

[DOI]

Yuxin Liu

Proceedings of the IEEE International Symposium on Information Theory, 2021

Edge removal in undirected networks.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2021

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

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2021

2020

The Edge-Removal Problem's Connections to the Zero-Error and $\delta$ -Dependence Problems in Network Coding.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2020

Lossless Source Coding in the Point-to-Point, Multiple Access, and Random Access Scenarios.

[BibT_eX]

[DOI]

Shuqing Chen

IEEE Trans. Inf. Theory, 2020

Towards an Operational Definition of Group Network Codes.

[BibT_eX]

[DOI]

Fei Wei

CoRR, 2020

Gaussian Multiple and Random Access in the Finite Blocklength Regime.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Yuxin Liu

Proceedings of the IEEE International Symposium on Information Theory, 2020

2019

Universal Mutual Information Privacy Guarantees for Smart Meters.

[BibT_eX]

[DOI]

Miguel Arrieta

Iñaki Esnaola

CoRR, 2019

A Local Perspective on the Edge Removal Problem.

[BibT_eX]

[DOI]

Fei Wei

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.

[BibT_eX]

[DOI]

Debaditya Chaudhuri

Proceedings of the IEEE International Symposium on Information Theory, 2019

Universal Privacy Guarantees for Smart Meters.

[BibT_eX]

[DOI]

Miguel Arrieta

Iñaki Esnaola

Proceedings of the IEEE International Symposium on Information Theory, 2019

2018

Can Negligible Rate Increase Network Reliability?

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2018

The Unbounded Benefit of Encoder Cooperation for the $k$ -User MAC.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2018

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

[BibT_eX]

[DOI]

CoRR, 2018

Can Negligihle Cooperation Increase Capacity? The Average-Error Case.

[BibT_eX]

[DOI]

Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

2017

A code equivalence between streaming network coding and streaming index coding.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

The benefit of encoder cooperation in the presence of state information.

[BibT_eX]

[DOI]

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).

[BibT_eX]

[DOI]

CoRR, 2016

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

[BibT_eX]

[DOI]

CoRR, 2016

On tightness of an entropic region outer bound for network coding and the edge removal property.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2016

Can negligible cooperation increase network reliability?

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2016

A characterization of the capacity region for network coding with dependent sources.

[BibT_eX]

[DOI]

Woong Kim

Proceedings of the IEEE International Symposium on Information Theory, 2016

On the Capacity Advantage of a Single Bit.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2015

An Equivalence Between Network Coding and Index Coding.

[BibT_eX]

[DOI]

Salim Y. El Rouayheb

IEEE Trans. Inf. Theory, 2015

The Multivariate Covering Lemma and its Converse.

[BibT_eX]

[DOI]

CoRR, 2015

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

[BibT_eX]

[DOI]

CoRR, 2015

A Perspective on Future Research Directions in Information Theory.

[BibT_eX]

[DOI]

Jeffrey G. Andrews

Alexandros G. Dimakis

CoRR, 2015

On the fundamental limits of caching in combination networks.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2015

On the cost and benefit of cooperation.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2015

2014

A Theory of Network Equivalence - Part II: Multiterminal Channels.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2014

On the Delay Advantage of Coding in Packet Erasure Networks.

[BibT_eX]

[DOI]

Alexandros G. Dimakis

IEEE Trans. Inf. Theory, 2014

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

[BibT_eX]

[DOI]

CoRR, 2014

Is there a canonical network for network information theory?

[BibT_eX]

[DOI]

Proceedings of the 2014 IEEE Information Theory Workshop, 2014

Linear capacity equivalence between multiple multicast and multiple unicast.

[BibT_eX]

[DOI]

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?

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the 52nd Annual Allerton Conference on Communication, 2014

2013

Multi-Resolution Video Streaming in Peer-to-peer Networks

[BibT_eX]

[DOI]

CoRR, 2013

Zero vs. epsilon Error in Interference Channels.

[BibT_eX]

[DOI]

CoRR, 2013

Zero vs. ε error in interference channels.

[BibT_eX]

[DOI]

Proceedings of the 2013 IEEE Information Theory Workshop, 2013

Outer bounds and a functional study of the edge removal problem.

[BibT_eX]

[DOI]

Eun Jee Lee

Proceedings of the 2013 IEEE Information Theory Workshop, 2013

Capacity region of multi-resolution streaming in peer-to-peer networks.

[BibT_eX]

[DOI]

Proceedings of the 2013 IEEE Information Theory Workshop, 2013

On a capacity equivalence between network and index coding and the edge removal problem.

[BibT_eX]

[DOI]

Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

On a capacity equivalence between multiple multicast and multiple unicast.

[BibT_eX]

[DOI]

Proceedings of the 51st Annual Allerton Conference on Communication, 2013

2012

The Price of Selfishness in Network Coding.

[BibT_eX]

[DOI]

Jason R. Marden

IEEE Trans. Inf. Theory, 2012

On dependence and delay: Capacity bounds for wireless networks.

[BibT_eX]

[DOI]

Proceedings of the 2012 IEEE Wireless Communications and Networking Conference, 2012

Source coding for dependent sources.

[BibT_eX]

[DOI]

Proceedings of the 2012 IEEE Information Theory Workshop, 2012

On network coding capacity under on-off scheduling.

[BibT_eX]

[DOI]

Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

Network equivalence in the presence of an eavesdropper.

[BibT_eX]

[DOI]

Proceedings of the 50th Annual Allerton Conference on Communication, 2012

Peer-to-peer anonymous networking using coding.

[BibT_eX]

[DOI]

Christopher S. Chang

Proceedings of the 50th Annual Allerton Conference on Communication, 2012

2011

A Theory of Network Equivalence - Part I: Point-to-Point Channels.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2011

Network Error Correction With Unequal Link Capacities.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2011

Near Optimality of Composite Multiple Description Source Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2011

Multiple-Access Network Information-Flow and Correction Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2011

Beyond Shannon: the quest for fundamental performance limits of wireless ad hoc networks.

[BibT_eX]

[DOI]

IEEE Commun. Mag., 2011

Equivalent models for multi-terminal channels.

[BibT_eX]

[DOI]

Flávio du Pin Calmon

Proceedings of the 2011 IEEE Information Theory Workshop, 2011

On the impact of a single edge on the network coding capacity.

[BibT_eX]

[DOI]

Proceedings of the Information Theory and Applications Workshop, 2011

On network error correction with limited feedback capacity.

[BibT_eX]

[DOI]

Proceedings of the Information Theory and Applications Workshop, 2011

On the equivalence of Shannon capacity and stable capacity in networks with memoryless channels.

[BibT_eX]

[DOI]

Hongyi Yao

Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

On distortion bounds for dependent sources over wireless networks.

[BibT_eX]

[DOI]

Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

A strong converse in source coding for super-source networks.

[BibT_eX]

[DOI]

Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

On equivalence for networks of noisy channels under byzantine attacks.

[BibT_eX]

[DOI]

Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

On capacity bounds for networks containing two-way channels.

[BibT_eX]

[DOI]

Proceedings of the 49th Annual Allerton Conference on Communication, 2011

Network coding: Is zero error always possible?

[BibT_eX]

[DOI]

Proceedings of the 49th Annual Allerton Conference on Communication, 2011

On sources and networks: Can computational tools derive information theoretic limits?

[BibT_eX]

[DOI]

Proceedings of the 49th Annual Allerton Conference on Communication, 2011

2010

Generalizing capacity: new definitions and capacity theorems for composite channels.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2010

Functional compression through graph coloring.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2010

New results on network error correction: Capacities and upper bounds.

[BibT_eX]

[DOI]

Proceedings of the Information Theory and Applications Workshop, 2010

On capacity outer bounds for a simple family of wireless networks.

[BibT_eX]

[DOI]

Proceedings of the Information Theory and Applications Workshop, 2010

On the separation of lossy source-network coding and channel coding in wireline networks.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2010

Capacity bounds for networks of broadcast channels.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2010

Concatenated Polar codes.

[BibT_eX]

[DOI]

Sidharth Jaggi

Proceedings of the IEEE International Symposium on Information Theory, 2010

On zero-error source coding with feedback.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2010

Optimal reverse carpooling over wireless networks - a distributed optimization approach.

[BibT_eX]

[DOI]

Proceedings of the 44th Annual Conference on Information Sciences and Systems, 2010

On equivalence between network topologies.

[BibT_eX]

[DOI]

Proceedings of the 48th Annual Allerton Conference on Communication, 2010

Compressive sensing over networks.

[BibT_eX]

[DOI]

Soheil Feizi

Proceedings of the 48th Annual Allerton Conference on Communication, 2010

2009

On lossless coding with coded side information.

[BibT_eX]

[DOI]

Daniel Marco

IEEE Trans. Inf. Theory, 2009

Source-Channel Coding and Separation for Generalized Communication Systems

[BibT_eX]

[DOI]

CoRR, 2009

A game theoretic approach to network coding.

[BibT_eX]

[DOI]

Jason R. Marden

Proceedings of the 2009 IEEE Information Theory Workshop, 2009

On a theory of network equivalence.

[BibT_eX]

[DOI]

Proceedings of the 2009 IEEE Information Theory Workshop, 2009

Rate rRegions for coherent and noncoherent multisource network error correction.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2009

A strong converse for a collection of network source coding problems.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2009

On the delay of network coding over line networks.

[BibT_eX]

[DOI]

Alexandros G. Dimakis

Proceedings of the IEEE International Symposium on Information Theory, 2009

On networks with side information.

[BibT_eX]

[DOI]

Asaf Cohen

Proceedings of the IEEE International Symposium on Information Theory, 2009

On feedback in network source coding.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2009

Beyond network equivalence.

[BibT_eX]

[DOI]

Proceedings of the 47th Annual Allerton Conference on Communication, 2009

2008

Quantization as Histogram Segmentation: Optimal Scalar Quantizer Design in Network Systems.

[BibT_eX]

[DOI]

Dan Muresan

IEEE Trans. Inf. Theory, 2008

Resilient Network Coding in the Presence of Byzantine Adversaries.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2008

Byzantine Modification Detection in Multicast Networks With Random Network Coding.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2008

On coding for reliable communication over packet networks.

[BibT_eX]

[DOI]

Phys. Commun., 2008

On approximating the rate regions for lossy source coding with coded and uncoded side information.

[BibT_eX]

[DOI]

Soumya Jana

Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

On achievable rates for multicast in the presence of side information.

[BibT_eX]

[DOI]

Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

Generalized Capacity and Source-Channel Coding for Packet Erasure Channels.

[BibT_eX]

[DOI]

Proceedings of the Global Communications Conference, 2008. GLOBECOM 2008, New Orleans, LA, USA, 30 November, 2008

Network coding with periodic recomputation for minimum energy multicasting in mobile ad-hoc networks.

[BibT_eX]

[DOI]

Proceedings of the 46th Annual Allerton Conference on Communication, 2008

Distributed design of network codes for wireless multiple unicasts.

[BibT_eX]

[DOI]

Proceedings of the 46th Annual Allerton Conference on Communication, 2008

A continuity theory for lossless source coding over networks.

[BibT_eX]

[DOI]

Proceedings of the 46th Annual Allerton Conference on Communication, 2008

Network codes with deadlines.

[BibT_eX]

[DOI]

Elona Erez

Proceedings of the 46th Annual Allerton Conference on Communication, 2008

On robust network coding subgraph construction under uncertainty.

[BibT_eX]

[DOI]

Christopher S. Chang

Proceedings of the 42nd Asilomar Conference on Signals, Systems and Computers, 2008

2007

A Practical Scheme for Wireless Network Operation.

[BibT_eX]

[DOI]

IEEE Trans. Commun., 2007

On Source Coding with Coded Side Information for a Binary Source with Binary Side Information.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2007

Capacity Definitions of General Channels with Receiver Side Information.

[BibT_eX]

[DOI]

Andrea Goldsmith

Proceedings of the IEEE International Symposium on Information Theory, 2007

Network Source Coding: Pipe Dream or Promise?

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2007

On Network Coding of Independent and Dependent Sources in Line Networks.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2007

Evolutionary Approaches To Minimizing Network Coding Resources.

[BibT_eX]

[DOI]

Proceedings of the INFOCOM 2007. 26th IEEE International Conference on Computer Communications, 2007

Optimal Strategies for Efficient Peer-to-Peer File Sharing.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Acoustics, 2007

2006

Introduction to the special issue on networking and information theory.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 2006

Separating distributed source coding from network coding.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2006

A Random Linear Network Coding Approach to Multicast.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2006

On rate-distortion with mixed types of side information.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2006

Capacity of wireless erasure networks.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2006

Low-Complexity Approaches to Slepian-Wolf Near-Lossless Distributed Data Compression.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2006

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

[BibT_eX]

[DOI]

CoRR, 2006

A Partial Solution for Lossless Source Coding with Coded Side Information.

[BibT_eX]

[DOI]

Daniel Marco

Proceedings of the 2006 IEEE Information Theory Workshop, 2006

A Tiling Approach to Network Code Design for Wireless Networks.

[BibT_eX]

[DOI]

Proceedings of the 2006 IEEE Information Theory Workshop, 2006

Low Complexity Encoding for Network Codes.

[BibT_eX]

[DOI]

Sidharth Jaggi

Yuval Cassuto

Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

On the Concavity of Rate Regions for Lossless Source Coding in Networks.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

On Mult-iResolution Coding and a Two-Hop Network.

[BibT_eX]

[DOI]

Proceedings of the 2006 Data Compression Conference (DCC 2006), 2006

Time-Sharing Vs. Source-Splitting in the Slepian-Wolf Problem: Error Exponents Analysis.

[BibT_eX]

[DOI]

Todd P. Coleman

Proceedings of the 2006 Data Compression Conference (DCC 2006), 2006

2005

Polynomial time algorithms for multicast network code construction.

[BibT_eX]

[DOI]

Ludo M. G. M. Tolhuizen

IEEE Trans. Inf. Theory, 2005

On the rate loss of multiple description source codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2005

Interference management via capacity-achieving codes for the deterministic broadcast channel.

[BibT_eX]

[DOI]

Proceedings of the IEEE ITSOC Information Theory Workshop 2005 on Coding and Complexity, 2005

Further results on coding for reliable communication over packet networks.

[BibT_eX]

[DOI]

Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

Correction of adversarial errors in networks.

[BibT_eX]

[DOI]

Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

Source coding for a simple multi-hop network.

[BibT_eX]

[DOI]

Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

On the rate loss and construction of source codes for broadcast channels.

[BibT_eX]

[DOI]

Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

Rate-splitting for the deterministic broadcast channel.

[BibT_eX]

[DOI]

Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

Towards bridging the gap between theory and practice for the Slepian-Wolf problem.

[BibT_eX]

[DOI]

Todd P. Coleman

Proceedings of the 2005 IEEE International Conference on Acoustics, 2005

Source Coding for a Multihop Network.

[BibT_eX]

[DOI]

Proceedings of the 2005 Data Compression Conference (DCC 2005), 2005

Towards Practical Minimum-Entropy Universal Decoding.

[BibT_eX]

[DOI]

Todd P. Coleman

Proceedings of the 2005 Data Compression Conference (DCC 2005), 2005

2004

Network Vector Quantization.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2004

Suboptimality of the Karhunen-Loève Transform for Transform Coding.

[BibT_eX]

[DOI]

Kenneth Zeger

IEEE Trans. Inf. Theory, 2004

Multiresolution vector quantization.

[BibT_eX]

[DOI]

Diego Dugatkin

IEEE Trans. Inf. Theory, 2004

Deterministic clustering with data nets

[BibT_eX]

[DOI]

Leonard J. Schulman

Electron. Colloquium Comput. Complex., 2004

On source and channel codes for multiple inputs and outputs: does multiple description beat space time?

[BibT_eX]

[DOI]

Proceedings of the 2004 IEEE Information Theory Workshop, 2004

Uniquely decodable multiple access source codes.

[BibT_eX]

[DOI]

Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

Communication and distributional complexity of joint probability mass functions.

[BibT_eX]

[DOI]

Sidharth Jaggi

Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

Byzantine modification detection in multicast networks using randomized network coding.

[BibT_eX]

[DOI]

Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

Rapid near-optimal VQ design with a deterministic data net.

[BibT_eX]

[DOI]

Leonard J. Schulman

Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

A new source-splitting approach to the slepian-wolf problem.

[BibT_eX]

[DOI]

Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

Multi-resolution Source Coding Using Entropy Constrained Dithered Scalar Quantization.

[BibT_eX]

[DOI]

Proceedings of the 2004 Data Compression Conference (DCC 2004), 2004

On Some New Approaches to Practical Slepian-Wolf Compression Inspired by Channel Coding.

[BibT_eX]

[DOI]

Proceedings of the 2004 Data Compression Conference (DCC 2004), 2004

2003

Lossless and near-lossless source coding for multiple access networks.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2003

Improved bounds for the rate loss of multiresolution source codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2003

Linear Network Codes: A Unified Framework for Source, Channel, and Network Coding.

[BibT_eX]

[DOI]

Proceedings of the Advances in Network Information Theory, 2003

Low Complexity Code Design for Lossless and Near-Lossless Side Information Source Codes.

[BibT_eX]

[DOI]

Proceedings of the 2003 Data Compression Conference (DCC 2003), 2003

Network Source Coding Using Entropy Constrained Dithered Quantization.

[BibT_eX]

[DOI]

Proceedings of the 2003 Data Compression Conference (DCC 2003), 2003

Suboptimality of the Karhuenen-Loève Transform for Transform Coding.

[BibT_eX]

[DOI]

Kenneth Zeger

Proceedings of the 2003 Data Compression Conference (DCC 2003), 2003

2002

Universal lossless source coding with the Burrows Wheeler Transform.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2002

On the rate-distortion performance and computational efficiency of the Karhunen-Loeve transform for lossy data compression.

[BibT_eX]

[DOI]

IEEE Trans. Image Process., 2002

Quantization as Histogram Segmentation: Globally Optimal Scalar Quantizer Design in Network System.

[BibT_eX]

[DOI]

Dan Muresan

Proceedings of the 2002 Data Compression Conference (DCC 2002), 2002

Codecell Contiguity in Optimal Fixed-Rate and Entropy-Constrained Network Scalar Quantizers.

[BibT_eX]

[DOI]

Dan Muresan

Proceedings of the 2002 Data Compression Conference (DCC 2002), 2002

2001

The capacity region of broadcast channels with intersymbol interference and colored Gaussian noise.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2001

Universal multiresolution source codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2001

Optimal Code Design for Lossless and Near Lossless Source Coding in Multiple Access Networks.

[BibT_eX]

[DOI]

Proceedings of the Data Compression Conference, 2001

Network Vector Quantization.

[BibT_eX]

[DOI]

Proceedings of the Data Compression Conference, 2001

2000

PPM performance with BWT complexity: a fast and effective data compression algorithm.

[BibT_eX]

[DOI]

Proc. IEEE, 2000

Joint design of vector quantizers and RCPC channel codes for Rayleigh fading channels.

[BibT_eX]

[DOI]

Yirong Shen

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.

[BibT_eX]

[DOI]

Proceedings of the Data Compression Conference, 2000

Multi-Resolution Adaptation of the SPIHT Algorithm for Multiple Description.

[BibT_eX]

[DOI]

Nedeljko Varnica

Proceedings of the Data Compression Conference, 2000

PPM Performance with BWT Complexity: A New Method for Lossless Data Compression.

[BibT_eX]

[DOI]

Proceedings of the Data Compression Conference, 2000

1999

Distortion-rate bounds for fixed- and variable-rate multiresolution source codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1999

Weighted universal image compression.

[BibT_eX]

[DOI]

IEEE Trans. Image Process., 1999

Separable Karhunen Loeve transforms for the weighted universal transform coding algorithm.

[BibT_eX]

[DOI]

Proceedings of the 1999 IEEE International Conference on Acoustics, 1999

Generalized Multiple Description Vector Quantization.

[BibT_eX]

[DOI]

Proceedings of the Data Compression Conference, 1999

Universal Lossless Source Coding with the Burrows Wheeler Transform.

[BibT_eX]

[DOI]

Proceedings of the Data Compression Conference, 1999

1998

Joint design of fixed-rate source codes and multiresolution channel codes.

[BibT_eX]

[DOI]

IEEE Trans. Commun., 1998

Optimal modeling for complex system design [data compression].

[BibT_eX]

[DOI]

IEEE Signal Process. Mag., 1998

Practical Multi-Resolution Source Coding: TSVQ Revisited.

[BibT_eX]

[DOI]

Proceedings of the Data Compression Conference, 1998

1997

Zerotree Design for Image Compression: Toward Weighted Universal Zerotree Coding.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 1997 International Conference on Image Processing, 1997

Iterative Joint Design of Source Codes and Multiresolution Channel Codes.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the 1997 IEEE International Conference on Acoustics, 1997

Conditional weighted universal source codes: second order statistics in universal coding.

[BibT_eX]

[DOI]

Proceedings of the 1997 IEEE International Conference on Acoustics, 1997

Fast Weighted Universal Transform Coding: Toward Optimal, Low Complexity Bases for Image Compression.

[BibT_eX]

[DOI]

Proceedings of the 7th Data Compression Conference (DCC '97), 1997

1996

A vector quantization approach to universal noiseless coding and quantization.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1996

1995

Weighted universal transform coding: universal image compression with the Karhunen-Loeve transform.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 1995 International Conference on Image Processing, 1995

Weighted universal bit allocation: optimal multiple quantization matrix coding.

[BibT_eX]

[DOI]

Proceedings of the 1995 International Conference on Acoustics, 1995

1994

A progressive universal noiseless coder.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1994

Variable-rate source coding theorems for stationary nonergodic sources.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1994

One-pass adaptive universal vector quantization.

[BibT_eX]

[DOI]

Proceedings of ICASSP '94: IEEE International Conference on Acoustics, 1994

Variable Dimension Weighted Universal Vector Quantization and Noiseless Coding.

[BibT_eX]

[DOI]