Variable-length-to-variable length source coding: a greedy step-by-step algorithm

Some results on variable-length-to-variable-length source coding are presented. A sufficient criterion for the asymptotic optimality of the generic V-V code is given. This also allows the study of the Tunstall-Huffman scheme performance. Then, a nonoptimal greedy approach to prefix codes is describe...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on information theory Ročník 38; číslo 5; s. 1609 - 1617
Hlavní autor: Fabris, F.
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York, NY IEEE 01.09.1992
Institute of Electrical and Electronics Engineers
Témata:
Applied sciences
Coding, codes
Exact sciences and technology
Information, signal and communications theory
Minimization methods
Probability distribution
Signal and communications theory
Source coding
Telecommunications and information theory
Optimal code
Gallager code
Coding
Algorithm
Huffman code
ISSN:0018-9448, 1557-9654
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Some results on variable-length-to-variable-length source coding are presented. A sufficient criterion for the asymptotic optimality of the generic V-V code is given. This also allows the study of the Tunstall-Huffman scheme performance. Then, a nonoptimal greedy approach to prefix codes is described, based on the informational divergence pseudometric and on the Gallager algorithm minimization of the current rate, associated with the subsequent extensions of the source probability distribution. Although optimality is not always reached, this technique can be usefully employed to improve the Tunstall-Huffman concatenation.< >
Bibliografie:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0018-9448
1557-9654
DOI:10.1109/18.149517