Ontology highlight
ABSTRACT: 
SUBMITTER: Garca JE
PROVIDER: S-EPMC8775014 | biostudies-literature | 2021 Dec
REPOSITORIES: biostudies-literature

Garca Jesús E JE González-López Verónica A VA Tasca Gustavo H GH Yaginuma Karina Y KY
Entropy (Basel, Switzerland) 20211230 1
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 mode ...[more]