An Efficient Coding Technique for Stochastic Processes

Autor: Jesús E. García, Verónica A. González-López, Gustavo H. Tasca, Karina Y. Yaginuma
Jazyk: angličtina
Rok vydání: 2021
Předmět:
Zdroj: Entropy, Vol 24, Iss 1, p 65 (2021)
Druh dokumentu: article
ISSN: 24010065
1099-4300
DOI: 10.3390/e24010065
Popis: In the framework of coding theory, under the assumption of a Markov process (Xt) on a finite alphabet A, the compressed representation of the data will be composed of a description of the model used to code the data and the encoded data. Given the model, the Huffman’s algorithm is optimal for the number of bits needed to encode the data. On the other hand, modeling (Xt) through a Partition Markov Model (PMM) promotes a reduction in the number of transition probabilities needed to define the model. This paper shows how the use of Huffman code with a PMM reduces the number of bits needed in this process. We prove the estimation of a PMM allows for estimating the entropy of (Xt), providing an estimator of the minimum expected codeword length per symbol. We show the efficiency of the new methodology on a simulation study and, through a real problem of compression of DNA sequences of SARS-CoV-2, obtaining in the real data at least a reduction of 10.4%.
Databáze: Directory of Open Access Journals
Externí odkaz:
Nepřihlášeným uživatelům se plný text nezobrazuje