Capacity-achieving guessing random additive noise decoding
We introduce a new algorithm for realizing maximum likelihood (ML) decoding for arbitrary
codebooks in discrete channels with or without memory, in which the receiver rank-orders …
codebooks in discrete channels with or without memory, in which the receiver rank-orders …
Fixed-length lossy compression in the finite blocklength regime
This paper studies the minimum achievable source coding rate as a function of blocklength
n and probability ϵ that the distortion exceeds a given level d. Tight general achievability …
n and probability ϵ that the distortion exceeds a given level d. Tight general achievability …
Lossy joint source-channel coding in the finite blocklength regime
This paper finds new tight finite-blocklength bounds for the best achievable lossy joint
source-channel code rate, and demonstrates that joint source-channel code design brings …
source-channel code rate, and demonstrates that joint source-channel code design brings …
Large deviations
SRS Varadhan - Proceedings of the International Congress of …, 2010 - World Scientific
Abstract The theory of Large Deviations deals with techniques for estimating probabilities of
rare events. These probabilities are exponentially small in a natural parameter and the task …
rare events. These probabilities are exponentially small in a natural parameter and the task …
Estimating the rate-distortion function by Wasserstein gradient descent
In the theory of lossy compression, the rate-distortion (RD) function $ R (D) $ describes how
much a data source can be compressed (in bit-rate) at any given level of fidelity (distortion) …
much a data source can be compressed (in bit-rate) at any given level of fidelity (distortion) …
Information-theoretic foundations of mismatched decoding
Shannon's channel coding theorem characterizes the maximal rate of information that can
be reliably transmitted over a communication channel when optimal encoding and decoding …
be reliably transmitted over a communication channel when optimal encoding and decoding …
Optimal lossless data compression: Non-asymptotics and asymptotics
This paper provides an extensive study of the behavior of the best achievable rate (and
other related fundamental limits) in variable-length strictly lossless compression. In the non …
other related fundamental limits) in variable-length strictly lossless compression. In the non …
Finite blocklength lossy source coding for discrete memoryless sources
Shannon propounded a theoretical framework (collectively called information theory) that
uses mathematical tools to understand, model and analyze modern mobile wireless …
uses mathematical tools to understand, model and analyze modern mobile wireless …
Neural estimation of the rate-distortion function with applications to operational source coding
A fundamental question in designing lossy data compression schemes is how well one can
do in comparison with the rate-distortion function, which describes the known theoretical …
do in comparison with the rate-distortion function, which describes the known theoretical …
Guessing noise, not code-words
We introduce a new algorithm for Maximum Likelihood (ML) decoding for channels with
memory. The algorithm is based on the principle that the receiver rank orders noise …
memory. The algorithm is based on the principle that the receiver rank orders noise …