Fast and efficient variable-to-fixed-length coding algorithm

Theo Algra · Electronics Letters · 1992

Variable-to-fixed-length coding implementations, according to the Tunstall algorithm, are shown to be significantly less complex than fixed-to-variable-length coding schemes such as the Huffman scheme. A modified version of Tunstall coding is presented, with improved compression ratio.

Read the paper · More papers on PaperTik