Aaron B. Wagner

CoRR, 2024

Optimal Redundancy in Exact Channel Synthesis.

[BibT_eX]

[DOI]

Sharang M. Sriramu

Proceedings of the IEEE International Symposium on Information Theory, 2024

Low-Rate, Low-Distortion Compression with Wasserstein Distortion.

[BibT_eX]

[DOI]

Yang Qiu

Proceedings of the IEEE International Symposium on Information Theory, 2024

Channel Coding with Mean and Variance Cost Constraints.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2024

The Rate-Distortion-Perception Trade-off: the Role of Private Randomness.

[BibT_eX]

[DOI]

Yassine Hamdi

Deniz Gündüz

Proceedings of the IEEE International Symposium on Information Theory, 2024

Wasserstein Distortion: Unifying Fidelity and Realism.

[BibT_eX]

[DOI]

Proceedings of the 58th Annual Conference on Information Sciences and Systems, 2024

2023

Minimax Rate-Distortion.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, December, 2023

Lossy Compression With Universal Distortion.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, June, 2023

Rate Region of the One-Help-Two Quadratic Gaussian Source-Coding Problem With Markovity.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, March, 2023

Timid/Bold Coding for Channels with Cost Constraints.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2023

2022

Functional Covering of Point Processes.

[BibT_eX]

[DOI]

IEEE J. Sel. Areas Inf. Theory, December, 2022

The Rate-Distortion-Perception Tradeoff: The Role of Common Randomness.

[BibT_eX]

[DOI]

CoRR, 2022

Do Neural Networks Compress Manifolds Optimally?

[BibT_eX]

[DOI]

Sourbh Bhadane

Johannes Ballé

Proceedings of the IEEE Information Theory Workshop, 2022

An Adaptive Composition Theorem for Maximal Leakage for Binary Inputs.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2022

On One-Bit Quantization.

[BibT_eX]

[DOI]

Sourbh Bhadane

Proceedings of the IEEE International Symposium on Information Theory, 2022

Efficiently Computable Converses for Finite-Blocklength Communication.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2022

2021

On Exact Asymptotics of the Error Probability in Channel Coding: Symmetric Channels.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2021

A coding theorem for the rate-distortion-perception function.

[BibT_eX]

[DOI]

Lucas Theis

CoRR, 2021

Guessing Outputs of Dynamically Pruned CNNs Using Memory Access Patterns.

[BibT_eX]

[DOI]

IEEE Comput. Archit. Lett., 2021

A Practical Coding Scheme for the BSC with Feedback.

[BibT_eX]

[DOI]

Ke Wu

Proceedings of the IEEE International Symposium on Information Theory, 2021

Principal Bit Analysis: Autoencoding with Schur-Concave Loss.

[BibT_eX]

[DOI]

Sourbh Bhadane

Jayadev Acharya

Proceedings of the 38th International Conference on Machine Learning, 2021

Neural Networks Optimally Compress the Sawbridge.

[BibT_eX]

[DOI]

Johannes Ballé

Proceedings of the 31st Data Compression Conference, 2021

2020

A New Method for Employing Feedback to Improve Coding Performance.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2020

An Operational Approach to Information Leakage.

[BibT_eX]

[DOI]

Sudeep Kamath

IEEE Trans. Inf. Theory, 2020

A New Stable Peer-to-Peer Protocol With Non-Persistent Peers: The Group Suppression Protocol.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2020

Estimating Quantum Entropy.

[BibT_eX]

[DOI]

IEEE J. Sel. Areas Inf. Theory, 2020

A Case for Maximal Leakage as a Side Channel Leakage Metric.

[BibT_eX]

[DOI]

Benjamin Wu

G. Edward Suh

CoRR, 2020

Strong Asymptotic Composition Theorems for Sibson Mutual Information.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2020

Gaussian Multiterminal Source-Coding with Markovity: An Efficiently-Computable Outer Bound.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2020

Optimal Mechanisms Under Maximal Leakage.

[BibT_eX]

[DOI]

Benjamin Wu

G. Edward Suh

Proceedings of the 8th IEEE Conference on Communications and Network Security, 2020

2019

Degradedness and Secrecy in Memoryless Queues.

[BibT_eX]

[DOI]

Nadine Hussami

IEEE Trans. Inf. Theory, 2019

LP Bounds for Rate-Distortion With Variable Side Information.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2019

The Stochastic-Calculus Approach to Multi-Receiver Poisson Channels.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2019

A New Proof for the Quadratic Gaussian Two-Encoder Source-Coding Problem.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2019

Measuring Quantum Entropy.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2019

2018

Variable Packet-Error Coding.

[BibT_eX]

[DOI]

Oliver Kosut

IEEE Trans. Inf. Theory, 2018

When Does Feedback Improve the Second-Order Coding Rate in Discrete Memoryless Channels?

[BibT_eX]

[DOI]

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

Variable Packet-Error Coding: the Point-to-Point Case.

[BibT_eX]

[DOI]

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

The Quadratic Gaussian One-Help-Two Source-Coding Problem with Markovity.

[BibT_eX]

[DOI]

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

2017

Vector Gaussian Rate-Distortion With Variable Side Information.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2017

Measuring Secrecy by the Probability of a Successful Guess.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2017

Coding for the Large-Alphabet Adversarial Channel.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2017

Resilient communication against adversarial path-errors.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE Military Communications Conference, 2017

Operational definitions for some common information leakage metrics.

[BibT_eX]

[DOI]

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

A new stable peer-to-peer protocol with non-persistent peers.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE Conference on Computer Communications, 2017

An LP Upper Bound for Rate Distortion with Variable Side Information.

[BibT_eX]

[DOI]

Proceedings of the 2017 Data Compression Conference, 2017

On very noisy channels with feedback.

[BibT_eX]

[DOI]

Proceedings of the 55th Annual Allerton Conference on Communication, 2017

Gaussian variable packet-error coding.

[BibT_eX]

[DOI]

Proceedings of the 55th Annual Allerton Conference on Communication, 2017

2016

A Downlink Scheduler for Multicasting Wireless Video-on-Demand.

[BibT_eX]

[DOI]

Md. Saifur Rahman

IEEE Trans. Mob. Comput., 2016

A Rate-Distortion Approach to Index Coding.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2016

An LP lower bound for rate distortion with variable side information.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2016

Maximal leakage minimization for the Shannon cipher system.

[BibT_eX]

[DOI]

Sudeep Kamath

Proceedings of the IEEE International Symposium on Information Theory, 2016

Vector Gaussian multi-decoder rate-distortion: Trace constraints.

[BibT_eX]

[DOI]

Proceedings of the 2016 Annual Conference on Information Science and Systems, 2016

An operational measure of information leakage.

[BibT_eX]

[DOI]

Sudeep Kamath

Proceedings of the 2016 Annual Conference on Information Science and Systems, 2016

2015

Rate Region of the Vector Gaussian One-Helper Source-Coding Problem.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2015

Information Embedding and the Triple Role of Control.

[BibT_eX]

[DOI]

Pulkit Grover

Anant Sahai

IEEE Trans. Inf. Theory, 2015

2014

Refinement of the Random Coding Bound.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2014

Moderate Deviations in Channel Coding.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2014

Refinement of the Sphere-Packing Bound: Asymmetric Channels.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2014

Feedback can improve the second-order coding performance in discrete memoryless channels.

[BibT_eX]

[DOI]

Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

The third-order term in the normal approximation for singular channels.

[BibT_eX]

[DOI]

Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Must one learn the channel to communicate at capacity?

[BibT_eX]

[DOI]

Yuguang Gao

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

2013

Classification of Homogeneous Data With Large Alphabets.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2013

General index coding with side information: Three decoder case.

[BibT_eX]

[DOI]

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

Achieving capacity of large alphabet discrete memoryless channels.

[BibT_eX]

[DOI]

Yuguang Gao

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

Lossless compression with moderate error probability.

[BibT_eX]

[DOI]

Ioannis Kontoyiannis

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

Feedback properties of Gaussian channels with feedback.

[BibT_eX]

[DOI]

James S. Freudenberg

Richard H. Middleton

Proceedings of the 52nd IEEE Conference on Decision and Control, 2013

Multicasting for wireless video-on-demand.

[BibT_eX]

[DOI]

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

Polytope codes for large-alphabet channels.

[BibT_eX]

[DOI]

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

2012

Sum Rate of the Vacationing-CEO Problem.

[BibT_eX]

[DOI]

Rajiv Soundararajan

Sriram Vishwanath

IEEE Trans. Inf. Theory, 2012

On the Optimality of Binning for Distributed Hypothesis Testing.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2012

Rate Region of the Gaussian Scalar-Help-Vector Source-Coding Problem.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2012

The Degraded Poisson Wiretap Channel.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2012

Reliability in Source Coding With Side Information.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2012

Source and Channel Simulation Using Arbitrary Randomness.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2012

Erasure Multiple Descriptions.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2012

Refinement of the sphere-packing bound.

[BibT_eX]

[DOI]

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

Near-lossless compression of large alphabet sources.

[BibT_eX]

[DOI]

Proceedings of the 46th Annual Conference on Information Sciences and Systems, 2012

2011

Probability Estimation in the Rare-Events Regime.

[BibT_eX]

[DOI]

Sanjeev R. Kulkarni

IEEE Trans. Inf. Theory, 2011

Distributed Rate-Distortion With Common Components.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2011

On Distributed Compression of Linear Functions.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2011

Improved Source Coding Exponents via Witsenhausen's Rate.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2011

Optimal Delay-Reconstruction Tradeoffs in Peer-to-Peer Networks.

[BibT_eX]

[DOI]

IEEE J. Sel. Areas Commun., 2011

Lossy source coding with Byzantine adversaries.

[BibT_eX]

[DOI]

Proceedings of the 2011 IEEE Information Theory Workshop, 2011

Compressing neighbors in a Gauss-Markov tree.

[BibT_eX]

[DOI]

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

Refinement of the sphere packing bound for symmetric channels.

[BibT_eX]

[DOI]

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

2010

The Gaussian many-help-one distributed source coding problem.

[BibT_eX]

[DOI]

Saurabha Tavildar

IEEE Trans. Inf. Theory, 2010

Information embedding meets distributed control

[BibT_eX]

[DOI]

Pulkit Grover

Anant Sahai

CoRR, 2010

On the Vacationing CEO Problem: Achievable Rates and Outer Bounds

[BibT_eX]

[DOI]

Rajiv Soundararajan

Sriram Vishwanath

CoRR, 2010

Secrecy capacity of the degraded Poisson wiretap channel.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2010

Universal hypothesis testing in the learning-limited regime.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2010

Moderate deviation analysis of channel coding: Discrete memoryless case.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2010

2009

Reliable Communication in the Absence of a Common Clock.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2009

Binary erasure multiple descriptions: Average-case distortion.

[BibT_eX]

[DOI]

Proceedings of the 2009 IEEE Information Theory Workshop, 2009

Vector Gaussian hypothesis testing and lossy one-helper problem.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2009

Improved Slepian-Wolf exponents via Witsenhausen's rate.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2009

Binary erasure multiple descriptions: Worst-case distortion.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2009

The lossy one-helper conjecture is false.

[BibT_eX]

[DOI]

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

2008

Rate Region of the Quadratic Gaussian Two-Encoder Source-Coding Problem.

[BibT_eX]

[DOI]

Saurabha Tavildar

IEEE Trans. Inf. Theory, 2008

An Improved Outer Bound for Multiterminal Source Coding.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2008

Error exponents and test channel optimization for the Gaussian Wyner-Ziv problem.

[BibT_eX]

[DOI]

Aggelos Vamvatsikos

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

A semicontinuity theorem and its application to network source coding.

[BibT_eX]

[DOI]

Jun Chen

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

An outer bound for distributed compression of linear functions.

[BibT_eX]

[DOI]

Proceedings of the 42nd Annual Conference on Information Sciences and Systems, 2008

2007

A Better Good-Turing Estimator for Sequence Probabilities.

[BibT_eX]

[DOI]

Sanjeev R. Kulkarni

Proceedings of the IEEE International Symposium on Information Theory, 2007

2006

Strong Consistency of the Good-Turing Estimator.

[BibT_eX]

[DOI]

Sanjeev R. Kulkarni

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

2005

Zero-rate reliability of the exponential-server timing channel.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2005

An Infeasibility Result for the Multiterminal Source-Coding Problem

[BibT_eX]

[DOI]

CoRR, 2005

Rate Region of the Quadratic Gaussian Two-Terminal Source-Coding Problem

[BibT_eX]

[DOI]

Saurabha Tavildar

CoRR, 2005

An improved outer bound for the multiterminal source-coding problem.

[BibT_eX]

[DOI]

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

2004

Feedback, queueing, and the reliability of the ideal Poisson channel above capacity.

[BibT_eX]

[DOI]

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

2003

A pairwise error probability bound for the exponential- server timing channel.

[BibT_eX]

[DOI]