AI Chat AI Image Generator AI Video Text to Speech

Entropy and Compression: A simple proof of an inequality of Khinchin

07/10/2019

∙

by Riccardo Aragona, et al.

∙

∙

We prove that Entropy is a lower bound for the average compression ratio of any lossless compressor by giving a simple proof of an inequality that is a slightly variation of an inequality firstly proved by A. I. Khinchin in 1953.

Riccardo Aragona
10 publications
Francesca Marzi
6 publications
Filippo Mignosi
5 publications

page 1

page 2

page 3

page 4

research

∙ 07/10/2019

Entropy and Compression: A simple proof of an inequality of Khinchin-Ornstein-Shields

We prove that Entropy is a lower bound for the average compression ratio...

0 Riccardo Aragona, et al. ∙

research

∙ 09/27/2021

Counting colorings of triangle-free graphs

By a theorem of Johansson, every triangle-free graph G of maximum degree...

0 Anton Bernshteyn, et al. ∙

research

∙ 03/29/2021

Asymptotically Optimal Massey-Like Inequality on Guessing Entropy With Application to Side-Channel Attack Evaluations

A Massey-like inequality is any useful lower bound on guessing entropy i...

0 Andrei Tanasescu, et al. ∙

research

∙ 02/11/2020

Generalized Bayesian Cramér-Rao Inequality via Information Geometry of Relative α-Entropy

The relative α-entropy is the Rényi analog of relative entropy and arise...

0 Kumar Vijay Mishra, et al. ∙

research

∙ 05/26/2023

An Analysis of the Johnson-Lindenstrauss Lemma with the Bivariate Gamma Distribution

Probabilistic proofs of the Johnson-Lindenstrauss lemma imply that rando...

0 Jason Bernstein, et al. ∙

research

∙ 10/31/2021

On The Absolute Constant in Hanson-Wright Inequality

We revisit and slightly modify the proof of the Gaussian Hanson-Wright i...

0 Kamyar Moshksar, et al. ∙

research

∙ 08/22/2023

Smooth min-entropy lower bounds for approximation chains

For a state ρ_A_1^n B, we call a sequence of states (σ_A_1^k B^(k))_k=1^...

0 Ashutosh Marwah, et al. ∙