Average Redundancy for Known Sources: Ubiquitous Trees in Source Coding - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Discrete Mathematics and Theoretical Computer Science Year : 2008

Average Redundancy for Known Sources: Ubiquitous Trees in Source Coding


Analytic information theory aims at studying problems of information theory using analytic techniques of computer science and combinatorics. Following Hadamard's precept, these problems are tackled by complex analysis methods such as generating functions, Mellin transform, Fourier series, saddle point method, analytic poissonization and depoissonization, and singularity analysis. This approach lies at the crossroad of computer science and information theory. In this survey we concentrate on one facet of information theory (i.e., source coding better known as data compression), namely the $\textit{redundancy rate}$ problem. The redundancy rate problem determines by how much the actual code length exceeds the optimal code length. We further restrict our interest to the $\textit{average}$ redundancy for $\textit{known}$ sources, that is, when statistics of information sources are known. We present precise analyses of three types of lossless data compression schemes, namely fixed-to-variable (FV) length codes, variable-to-fixed (VF) length codes, and variable-to-variable (VV) length codes. In particular, we investigate average redundancy of Huffman, Tunstall, and Khodak codes. These codes have succinct representations as $\textit{trees}$, either as coding or parsing trees, and we analyze here some of their parameters (e.g., the average path from the root to a leaf).
Fichier principal
Vignette du fichier
dmAI0102.pdf (426.05 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive

Dates and versions

hal-01194680 , version 1 (07-09-2015)



Wojciech Szpankowski. Average Redundancy for Known Sources: Ubiquitous Trees in Source Coding. Fifth Colloquium on Mathematics and Computer Science, 2008, Kiel, Germany. pp.19-58, ⟨10.46298/dmtcs.3555⟩. ⟨hal-01194680⟩


107 View
507 Download



Gmail Facebook Twitter LinkedIn More