Name
Abstract | ||
|---|---|---|
Abstract—We,present an approach,to compress,arbi- trary 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 sub- strings 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. Index Terms—Genetic algorithm, data structures, appli- cation, Huffman coding. |
Year | Venue | Keywords |
|---|---|---|
2008 | GEM | data structure,genetic algorithm,code generation,huffman codes,indexing terms,genetics |
Field | DocType | Citations |
Modified Huffman coding,Tunstall coding,Substring,Computer science,Algorithm,Huffman coding,Shannon–Fano coding,Genetic algorithm,Variable-length code,Canonical Huffman code | Conference | 0 |
PageRank | References | Authors |
0.34 | 5 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Cody Boisclair | 1 | 1 | 0.69 |
| Markus Wagner | 2 | 0 | 0.34 |