Huffman coding and minimal Markov models to improve the data compression.

Autor: García, Jesús E., González-López, V. A., Tasca, G. H.
Předmět:
Zdroj: AIP Conference Proceedings; 2023, Vol. 2849 Issue 1, p1-4, 4p
Abstrakt: In this paper, we take advantage of the junction of the Huffman coding strategy with the concept of Minimal Partition (see [3]). The Huffman coding attributes shorter codes to the most used elements in a message. The Minimal Partition of the state space reduces the number of transition probabilities to be specified. Both notions allow building a strategy that reduces the number of bits required to transmit the information necessary to recover an encoded message. This type of strategy could be used to optimize multiple encodings assuming the same source. [ABSTRACT FROM AUTHOR]
Databáze: Complementary Index