Please use this identifier to cite or link to this item:
https://hdl.handle.net/2440/77090
Type: | Conference paper |
Title: | Better Huffman coding via genetic algorithm |
Author: | Boisclair, C. Wagner, M. |
Citation: | Proceedings of the 2008 International Conference on Genetic and Evolutionary Methods, GEM 2008, July 14-17, 2008, Las Vegas, Nevada, USA: pp.30-34 |
Publisher: | CSREA Press |
Publisher Place: | USA |
Issue Date: | 2008 |
ISBN: | 1601320698 9781601320698 |
Conference Name: | Conference on Genetic and Evolutionary Methods (2008 : Las Vegas, Nevada, U.S.A.) |
Editor: | Arabnia, H. Youngsong, M. |
Statement of Responsibility: | Cody Boisclair, Markus Wagner |
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. |
Keywords: | Genetic algorithm data structures application Huffman coding. |
Rights: | Copyright status unknown |
Appears in Collections: | Aurora harvest 4 Computer Science publications |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.