Title :
An Efficient Implementation of Adaptive Prefix Coding
Author_Institution :
Dept. of Comput. Sci., Bonn Univ., Bonn
Abstract :
The goal of the prefix coding is to assign codewords to elements of the input alphabet A, so that no codeword is a prefix of another one, and the total length of the encoded message S is minimized. In the case of static prefix coding, symbol frequencies are known in advance. In the case of adaptive (or dynamic) prefix coding, every symbol Si is encoded before the next symbol Si+1 is read.
Keywords :
adaptive codes; encoding; adaptive prefix coding; codeword assignment; message encoding; symbol frequency; Adaptive algorithm; Adaptive coding; Arithmetic; Computer science; Costs; Decoding; Frequency; Information theory; Testing; Upper bound;
Conference_Titel :
Data Compression Conference, 2007. DCC '07
Conference_Location :
Snowbird, UT
Print_ISBN :
0-7695-2791-4
DOI :
10.1109/DCC.2007.12