Aaron B. Wagner

Orcid: 0000-0001-9127-0089

According to our database1, Aaron B. Wagner authored at least 109 papers between 2003 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

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

Optimal Redundancy in Exact Channel Synthesis.
CoRR, 2024

Channel Coding with Mean and Variance Cost Constraints.
CoRR, 2024

Wasserstein Distortion: Unifying Fidelity and Realism.
Proceedings of the 58th Annual Conference on Information Sciences and Systems, 2024

2023
Minimax Rate-Distortion.
IEEE Trans. Inf. Theory, December, 2023

Lossy Compression With Universal Distortion.
IEEE Trans. Inf. Theory, June, 2023

Rate Region of the One-Help-Two Quadratic Gaussian Source-Coding Problem With Markovity.
IEEE Trans. Inf. Theory, March, 2023

Timid/Bold Coding for Channels with Cost Constraints.
Proceedings of the IEEE International Symposium on Information Theory, 2023

2022
Functional Covering of Point Processes.
IEEE J. Sel. Areas Inf. Theory, December, 2022

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

Do Neural Networks Compress Manifolds Optimally?
Proceedings of the IEEE Information Theory Workshop, 2022

An Adaptive Composition Theorem for Maximal Leakage for Binary Inputs.
Proceedings of the IEEE International Symposium on Information Theory, 2022

On One-Bit Quantization.
Proceedings of the IEEE International Symposium on Information Theory, 2022

Efficiently Computable Converses for Finite-Blocklength Communication.
Proceedings of the IEEE International Symposium on Information Theory, 2022

2021
On Exact Asymptotics of the Error Probability in Channel Coding: Symmetric Channels.
IEEE Trans. Inf. Theory, 2021

A coding theorem for the rate-distortion-perception function.
CoRR, 2021

Guessing Outputs of Dynamically Pruned CNNs Using Memory Access Patterns.
IEEE Comput. Archit. Lett., 2021

A Practical Coding Scheme for the BSC with Feedback.
Proceedings of the IEEE International Symposium on Information Theory, 2021

Principal Bit Analysis: Autoencoding with Schur-Concave Loss.
Proceedings of the 38th International Conference on Machine Learning, 2021

Neural Networks Optimally Compress the Sawbridge.
Proceedings of the 31st Data Compression Conference, 2021

2020
A New Method for Employing Feedback to Improve Coding Performance.
IEEE Trans. Inf. Theory, 2020

An Operational Approach to Information Leakage.
IEEE Trans. Inf. Theory, 2020

A New Stable Peer-to-Peer Protocol With Non-Persistent Peers: The Group Suppression Protocol.
IEEE Trans. Inf. Theory, 2020

Estimating Quantum Entropy.
IEEE J. Sel. Areas Inf. Theory, 2020

A Case for Maximal Leakage as a Side Channel Leakage Metric.
CoRR, 2020

Strong Asymptotic Composition Theorems for Sibson Mutual Information.
Proceedings of the IEEE International Symposium on Information Theory, 2020

Gaussian Multiterminal Source-Coding with Markovity: An Efficiently-Computable Outer Bound.
Proceedings of the IEEE International Symposium on Information Theory, 2020

Optimal Mechanisms Under Maximal Leakage.
Proceedings of the 8th IEEE Conference on Communications and Network Security, 2020

2019
Degradedness and Secrecy in Memoryless Queues.
IEEE Trans. Inf. Theory, 2019

LP Bounds for Rate-Distortion With Variable Side Information.
IEEE Trans. Inf. Theory, 2019

The Stochastic-Calculus Approach to Multi-Receiver Poisson Channels.
IEEE Trans. Inf. Theory, 2019

A New Proof for the Quadratic Gaussian Two-Encoder Source-Coding Problem.
Proceedings of the IEEE International Symposium on Information Theory, 2019

Measuring Quantum Entropy.
Proceedings of the IEEE International Symposium on Information Theory, 2019

2018
Variable Packet-Error Coding.
IEEE Trans. Inf. Theory, 2018

When Does Feedback Improve the Second-Order Coding Rate in Discrete Memoryless Channels?
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

Variable Packet-Error Coding: the Point-to-Point Case.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

The Quadratic Gaussian One-Help-Two Source-Coding Problem with Markovity.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

2017
Vector Gaussian Rate-Distortion With Variable Side Information.
IEEE Trans. Inf. Theory, 2017

Measuring Secrecy by the Probability of a Successful Guess.
IEEE Trans. Inf. Theory, 2017

Coding for the Large-Alphabet Adversarial Channel.
IEEE Trans. Inf. Theory, 2017

Resilient communication against adversarial path-errors.
Proceedings of the 2017 IEEE Military Communications Conference, 2017

Operational definitions for some common information leakage metrics.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

A new stable peer-to-peer protocol with non-persistent peers.
Proceedings of the 2017 IEEE Conference on Computer Communications, 2017

An LP Upper Bound for Rate Distortion with Variable Side Information.
Proceedings of the 2017 Data Compression Conference, 2017

On very noisy channels with feedback.
Proceedings of the 55th Annual Allerton Conference on Communication, 2017

Gaussian variable packet-error coding.
Proceedings of the 55th Annual Allerton Conference on Communication, 2017

2016
A Downlink Scheduler for Multicasting Wireless Video-on-Demand.
IEEE Trans. Mob. Comput., 2016

A Rate-Distortion Approach to Index Coding.
IEEE Trans. Inf. Theory, 2016

An LP lower bound for rate distortion with variable side information.
Proceedings of the IEEE International Symposium on Information Theory, 2016

Maximal leakage minimization for the Shannon cipher system.
Proceedings of the IEEE International Symposium on Information Theory, 2016

Vector Gaussian multi-decoder rate-distortion: Trace constraints.
Proceedings of the 2016 Annual Conference on Information Science and Systems, 2016

An operational measure of information leakage.
Proceedings of the 2016 Annual Conference on Information Science and Systems, 2016

2015
Rate Region of the Vector Gaussian One-Helper Source-Coding Problem.
IEEE Trans. Inf. Theory, 2015

Information Embedding and the Triple Role of Control.
IEEE Trans. Inf. Theory, 2015

2014
Refinement of the Random Coding Bound.
IEEE Trans. Inf. Theory, 2014

Moderate Deviations in Channel Coding.
IEEE Trans. Inf. Theory, 2014

Refinement of the Sphere-Packing Bound: Asymmetric Channels.
IEEE Trans. Inf. Theory, 2014

Feedback can improve the second-order coding performance in discrete memoryless channels.
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.
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?
Proceedings of the 52nd Annual Allerton Conference on Communication, 2014

2013
Classification of Homogeneous Data With Large Alphabets.
IEEE Trans. Inf. Theory, 2013

General index coding with side information: Three decoder case.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

Achieving capacity of large alphabet discrete memoryless channels.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

Lossless compression with moderate error probability.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

Feedback properties of Gaussian channels with feedback.
Proceedings of the 52nd IEEE Conference on Decision and Control, 2013

Multicasting for wireless video-on-demand.
Proceedings of the 51st Annual Allerton Conference on Communication, 2013

Polytope codes for large-alphabet channels.
Proceedings of the 51st Annual Allerton Conference on Communication, 2013

2012
Sum Rate of the Vacationing-CEO Problem.
IEEE Trans. Inf. Theory, 2012

On the Optimality of Binning for Distributed Hypothesis Testing.
IEEE Trans. Inf. Theory, 2012

Rate Region of the Gaussian Scalar-Help-Vector Source-Coding Problem.
IEEE Trans. Inf. Theory, 2012

The Degraded Poisson Wiretap Channel.
IEEE Trans. Inf. Theory, 2012

Reliability in Source Coding With Side Information.
IEEE Trans. Inf. Theory, 2012

Source and Channel Simulation Using Arbitrary Randomness.
IEEE Trans. Inf. Theory, 2012

Erasure Multiple Descriptions.
IEEE Trans. Inf. Theory, 2012

Refinement of the sphere-packing bound.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

Near-lossless compression of large alphabet sources.
Proceedings of the 46th Annual Conference on Information Sciences and Systems, 2012

2011
Probability Estimation in the Rare-Events Regime.
IEEE Trans. Inf. Theory, 2011

Distributed Rate-Distortion With Common Components.
IEEE Trans. Inf. Theory, 2011

On Distributed Compression of Linear Functions.
IEEE Trans. Inf. Theory, 2011

Improved Source Coding Exponents via Witsenhausen's Rate.
IEEE Trans. Inf. Theory, 2011

Optimal Delay-Reconstruction Tradeoffs in Peer-to-Peer Networks.
IEEE J. Sel. Areas Commun., 2011

Lossy source coding with Byzantine adversaries.
Proceedings of the 2011 IEEE Information Theory Workshop, 2011

Compressing neighbors in a Gauss-Markov tree.
Proceedings of the 49th Annual Allerton Conference on Communication, 2011

Refinement of the sphere packing bound for symmetric channels.
Proceedings of the 49th Annual Allerton Conference on Communication, 2011

2010
The Gaussian many-help-one distributed source coding problem.
IEEE Trans. Inf. Theory, 2010

Information embedding meets distributed control
CoRR, 2010

On the Vacationing CEO Problem: Achievable Rates and Outer Bounds
CoRR, 2010

Secrecy capacity of the degraded Poisson wiretap channel.
Proceedings of the IEEE International Symposium on Information Theory, 2010

Universal hypothesis testing in the learning-limited regime.
Proceedings of the IEEE International Symposium on Information Theory, 2010

Moderate deviation analysis of channel coding: Discrete memoryless case.
Proceedings of the IEEE International Symposium on Information Theory, 2010

2009
Reliable Communication in the Absence of a Common Clock.
IEEE Trans. Inf. Theory, 2009

Binary erasure multiple descriptions: Average-case distortion.
Proceedings of the 2009 IEEE Information Theory Workshop, 2009

Vector Gaussian hypothesis testing and lossy one-helper problem.
Proceedings of the IEEE International Symposium on Information Theory, 2009

Improved Slepian-Wolf exponents via Witsenhausen's rate.
Proceedings of the IEEE International Symposium on Information Theory, 2009

Binary erasure multiple descriptions: Worst-case distortion.
Proceedings of the IEEE International Symposium on Information Theory, 2009

The lossy one-helper conjecture is false.
Proceedings of the 47th Annual Allerton Conference on Communication, 2009

2008
Rate Region of the Quadratic Gaussian Two-Encoder Source-Coding Problem.
IEEE Trans. Inf. Theory, 2008

An Improved Outer Bound for Multiterminal Source Coding.
IEEE Trans. Inf. Theory, 2008

Error exponents and test channel optimization for the Gaussian Wyner-Ziv problem.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

A semicontinuity theorem and its application to network source coding.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

An outer bound for distributed compression of linear functions.
Proceedings of the 42nd Annual Conference on Information Sciences and Systems, 2008

2007
A Better Good-Turing Estimator for Sequence Probabilities.
Proceedings of the IEEE International Symposium on Information Theory, 2007

2006
Strong Consistency of the Good-Turing Estimator.
Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

2005
Zero-rate reliability of the exponential-server timing channel.
IEEE Trans. Inf. Theory, 2005

An Infeasibility Result for the Multiterminal Source-Coding Problem
CoRR, 2005

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

An improved outer bound for the multiterminal source-coding problem.
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

2004
Feedback, queueing, and the reliability of the ideal Poisson channel above capacity.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

2003
A pairwise error probability bound for the exponential- server timing channel.
Proceedings of IEEE International Conference on Communications, 2003


  Loading...