Asymptotics and Non-Asymptotics for Universal Fixed-to-Variable Source Coding
From MaRDI portal
Abstract: Universal fixed-to-variable lossless source coding for memoryless sources is studied in the finite blocklength and higher-order asymptotics regimes. Optimal third-order coding rates are derived for general fixed-to-variable codes and for prefix codes. It is shown that the non-prefix Type Size code, in which codeword lengths are chosen in ascending order of type class size, achieves the optimal third-order rate and outperforms classical Two-Stage codes. Converse results are proved making use of a result on the distribution of the empirical entropy and Laplace's approximation. Finally, the fixed-to-variable coding problem without a prefix constraint is shown to be essentially the same as the universal guessing problem.
Cited in
(8)- Asymptotic property of universal lossless coding for independent piecewise identically distributed sources
- scientific article; zbMATH DE number 5941301 (Why is no real title available?)
- Almost-sure variable-length source coding theorems for general sources
- THEORETICALLY EFFECTIVE ASYMPTOTICALLY OPTIMAL UNIVERSAL CODING OF PARTIALLY DEFINED SOURCES
- Non-Asymptotic Converse Bounds and Refined Asymptotics for Two Source Coding Problems
- Corrections to “Hash Property and Fixed-Rate Universal Coding Theorems” [Jun 10 2688-2698]
- Universal Source Coding for Monotonic and Fast Decaying Monotonic Distributions
- Finite Blocklength Lossy Source Coding for Discrete Memoryless Sources
This page was built for publication: Asymptotics and Non-Asymptotics for Universal Fixed-to-Variable Source Coding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4682976)
