For the problem of lossless compression of a memoryless source, we give a detailed, precise characterization of the best achievable error probability, in the 'moderate error probability' regime. This is the asymptotic setting where the probability of error decays to zero while at the same time the rate converges to the entropy at a speed no faster than 1/√N. These results combine some of the essential benefits of earlier analyses in terms of error exponents and of Gaussian approximation. Analogous results for the problem of hypothesis testing are also established. © 2013 IEEE
Motivated by the Markov chain Monte Carlo (MCMC) approach to the compression of discrete sources dev...
The problem of lossless data compression with side information available to both the encoder and the...
This paper studies the minimum achievable source coding rate as a function of blocklength n and prob...
Abstract—This paper considers the distribution of the optimum rate of lossless compression. It shows...
This paper provides an extensive study of the behavior of the best achievable rate (and other relate...
This paper considers the distribution of the optimum rate of fixed-to-variable lossless compression....
This paper studies the minimum achievable source coding rate as a function of blocklength n and tole...
This work1 deals with the fundamental limits of strictly-lossless variable-length compression of kno...
This paper studies the fundamental limits of the minimum average length of lossless and lossy variab...
Abstract—This paper shows new general nonasymptotic achievability and converse bounds and performs t...
We characterize the achievable pointwise redundancy rates for lossy data compression at a fixed dist...
The following critical phenomenon was recently discovered. When a memoryless source is compressed us...
Abstract—In Shannon theory, lossless source coding deals with the optimal compression of discrete so...
Fundamental limits on the source coding exponents (or large deviations performance) of zero-delay fi...
The problem of determining the best achievable performance of arbitrary lossless compression algorit...
Motivated by the Markov chain Monte Carlo (MCMC) approach to the compression of discrete sources dev...
The problem of lossless data compression with side information available to both the encoder and the...
This paper studies the minimum achievable source coding rate as a function of blocklength n and prob...
Abstract—This paper considers the distribution of the optimum rate of lossless compression. It shows...
This paper provides an extensive study of the behavior of the best achievable rate (and other relate...
This paper considers the distribution of the optimum rate of fixed-to-variable lossless compression....
This paper studies the minimum achievable source coding rate as a function of blocklength n and tole...
This work1 deals with the fundamental limits of strictly-lossless variable-length compression of kno...
This paper studies the fundamental limits of the minimum average length of lossless and lossy variab...
Abstract—This paper shows new general nonasymptotic achievability and converse bounds and performs t...
We characterize the achievable pointwise redundancy rates for lossy data compression at a fixed dist...
The following critical phenomenon was recently discovered. When a memoryless source is compressed us...
Abstract—In Shannon theory, lossless source coding deals with the optimal compression of discrete so...
Fundamental limits on the source coding exponents (or large deviations performance) of zero-delay fi...
The problem of determining the best achievable performance of arbitrary lossless compression algorit...
Motivated by the Markov chain Monte Carlo (MCMC) approach to the compression of discrete sources dev...
The problem of lossless data compression with side information available to both the encoder and the...
This paper studies the minimum achievable source coding rate as a function of blocklength n and prob...