Content deleted Content added
mNo edit summary |
|||
Line 1:
'''Adaptive Huffman coding''' is an [[adaptive coding]] technique based on [[Huffman coding]], building the code as the symbols are being transmitted, having no initial knowledge of source distribution, that allows one-pass encoding and adaptation to changing conditions in data. <br>
The benefit of one-pass procedure is that the sorce can be encoded realtime, though it becomes more sensitive to transmission errors, since just single loss ruins the whole code.
==Algoritms==
There exists a number of implementaions of this method, the most notable are '''FGK''' (Faller-[[Robert G. Gallager |Gallager]]-[[Donald Knuth|Knuth]])and '''Vitter''' algorithm.
===Vitter algorithm===
| |||