Sciweavers

GEM
2008

Better Huffman Coding via Genetic Algorithm

13 years 5 months ago
Better Huffman Coding via Genetic Algorithm
Abstract--We present an approach to compress arbitrary files using a Huffman-like prefix-free code generated through the use of a genetic algorithm, thus requiring no prior knowledge of substring frequencies in the original file. This approach also enables multiple-character substrings to be encoded. We demonstrate, through testing on various different formats of real-world data, that in some domains, there is some significant advantage to using this genetic approach over the traditional Huffman algorithm and other existing compression methods.
Cody Boisclair, Markus Wagner
Added 29 Oct 2010
Updated 29 Oct 2010
Type Conference
Year 2008
Where GEM
Authors Cody Boisclair, Markus Wagner
Comments (0)