Optimal Lossless Data Compression: Non-Asymptotics and Asymptotics
From MaRDI portal
Cited in
(23)- Inequalities and algorithms for universal data compression
- Optimal data compression algorithm
- Varentropy of past lifetimes
- Entropy and compression: a simple proof of an inequality of Khinchin-Ornstein-Shields
- Asymptotically optimal low-complexity sequential lossless coding for piecewise-stationary memoryless sources. I: The regular case
- Mismatched codebooks and the role of entropy coding in lossy data compression
- On Joint Information Embedding and Lossy Compression
- Redundancy of Lossless Data Compression for Known Sources by Analytic Methods
- On the performance of recency-rank and block-sorting universal lossless data compression algorithms
- ANALYSIS AND APPLICATIONS OF THE RESIDUAL VARENTROPY OF RANDOM LIFETIMES
- Varentropy of order statistics and some stochastic comparisons
- A NEW GENERALIZED VARENTROPY AND ITS PROPERTIES
- Using Lossless Data Compression in Data Storage Systems: Not for Saving Space
- Rényi Information Dimension: Fundamental Limits of Almost Lossless Analog Compression
- scientific article; zbMATH DE number 3318548 (Why is no real title available?)
- SOME MEASURES INFORMATION FOR GENERALIZED AND q-GENERALIZED EXTREME VALUES AND ITS PROPERTIES
- Finite Blocklength Lossy Source Coding for Discrete Memoryless Sources
- Varentropy estimators with applications in testing uniformity
- Varentropy estimators applied to test of fit for inverse Gaussian distribution
- Varentropy estimators applied to goodness of fit tests for the Gumbel distribution
- Weighted past and paired dynamic varentropy measures, their properties, usefulness and inferences
- Monte Carlo comparison of normality tests based on varentropy estimators
- Second-order converses via reverse hypercontractivity
This page was built for publication: Optimal Lossless Data Compression: Non-Asymptotics and Asymptotics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5346092)