Universal Compression of Memoryless Sources Over Unknown Alphabets
From MaRDI portal
Publication:3547440
Recommendations
Cited in
(21)- Inequalities and algorithms for universal data compression
- Unconditional bases and bit-level compression
- On the occupancy problem for a regime-switching model
- Universal lossless source coding with the Burrows Wheeler transform
- Bounds from a card trick
- A lower-bound for the maximin redundancy in pattern coding
- Phase transitions for the uniform distribution in the pattern maximum likelihood problem and its Bethe approximation
- A lower bound on compression of unknown alphabets
- Functional central limit theorems for occupancies and missing mass process in infinite urn models
- On a connection between information and group lattices
- Entropy of some models of sparse random graphs with vertex-names
- A joint Shannon cipher and privacy amplification approach to attaining exponentially decaying information leakage
- Estimating Entropy Rates with Bayesian Confidence Intervals
- Universal Compression of Markov and Related Sources Over Arbitrary Alphabets
- Speaking of Infinity
- Universal Lossless Compression With Unknown Alphabets—The Average Case
- scientific article; zbMATH DE number 7625180 (Why is no real title available?)
- On consistent and rate optimal estimation of the missing mass
- Methods for diversity and overlap analysis in T-cell receptor populations
- scientific article; zbMATH DE number 7370523 (Why is no real title available?)
- Entropy of Patterns of i.i.d. Sequences—Part I: General Bounds
This page was built for publication: Universal Compression of Memoryless Sources Over Unknown Alphabets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3547440)