Kanonik Huffman kod sözcükleri uzunluklarının evrim stratejileri algoritması ile belirlenmesi.

Huffman coding is widely used in data compression. Canonical Huffman coding is a subset of Huffman coding and has some advantages, such as shorter header and less memory usage. Therefore, studies on this coding have been continuing. The algorithm producing the lengths of Algebraic Canonical Huffman Codes (ACHC) is one of these studies and this algorithm obtains the code lengths nearest to optimum value. In this study, an algorithm obtaining the code lengths that are the basis for the production of canonical Huffman codes using Evolutionary Strategies (ESs) is proposed, and this algorithm means that the ACHC algorithm is optimized by the ESs method. ESs is an evolutionary algorithm that mostly uses the mutation. Replication creates many copies of a single ancestor. The copies are mutated to produce offspring. Among the offspring and the ancestor, the individual with the best fitness value is chosen as the ancestor of the next generation. This cycle continues until the stop criteria is met. In this study, the length array obtained by ACHC was used as the first ancestor. The optimum value was achieved as a result of the evolution of this ancestor by mutation. As a result of the tests, the required number of cycles to reach the optimum value was determined as a fixed number. In this case, the time complexity is O (n²), where n is the number of symbols used. The amount of memory used is O (n²) because of the usage of multiple individuals. [ABSTRACT FROM AUTHOR]