Average Redundancy for Known Sources: Ubiquitous Trees in Source Coding

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, saddl...

Full description

Bibliographic Details
Main Author: Wojciech Szpankowski
Format: Article
Language:English
Published: Discrete Mathematics & Theoretical Computer Science 2008-01-01
Series:Discrete Mathematics & Theoretical Computer Science
Subjects:
complex asymptotics
mellin transform
distribution modulo $1$
redundancy
khodak code
tunstall code
huffman code
data compression
source coding
prefix codes
kraft's inequality
shannon lower bound
[info.info-dm] computer science [cs]/discrete mathematics [cs.dm]
[math.math-ds] mathematics [math]/dynamical systems [math.ds]
[math.math-co] mathematics [math]/combinatorics [math.co]
Online Access:https://dmtcs.episciences.org/3555/pdf

Internet

https://dmtcs.episciences.org/3555/pdf

Similar Items