{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,14]],"date-time":"2026-05-14T14:50:32Z","timestamp":1778770232660,"version":"3.51.4"},"reference-count":16,"publisher":"MDPI AG","issue":"1","license":[{"start":{"date-parts":[[2021,12,30]],"date-time":"2021-12-30T00:00:00Z","timestamp":1640822400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>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\u2019s 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%.<\/jats:p>","DOI":"10.3390\/e24010065","type":"journal-article","created":{"date-parts":[[2021,12,30]],"date-time":"2021-12-30T21:41:21Z","timestamp":1640900481000},"page":"65","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["An Efficient Coding Technique for Stochastic Processes"],"prefix":"10.3390","volume":"24","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6952-1635","authenticated-orcid":false,"given":"Jes\u00fas","family":"Garc\u00eda","sequence":"first","affiliation":[{"name":"Department of Statistics, University of Campinas, Rua S\u00e9rgio Buarque de Holanda, 651, Campinas, S\u00e3o Paulo 13083-859, Brazil"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3514-4130","authenticated-orcid":false,"given":"Ver\u00f3nica","family":"Gonz\u00e1lez-L\u00f3pez","sequence":"additional","affiliation":[{"name":"Department of Statistics, University of Campinas, Rua S\u00e9rgio Buarque de Holanda, 651, Campinas, S\u00e3o Paulo 13083-859, Brazil"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6917-7072","authenticated-orcid":false,"given":"Gustavo","family":"Tasca","sequence":"additional","affiliation":[{"name":"Department of Statistics, University of Campinas, Rua S\u00e9rgio Buarque de Holanda, 651, Campinas, S\u00e3o Paulo 13083-859, Brazil"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5731-0841","authenticated-orcid":false,"given":"Karina","family":"Yaginuma","sequence":"additional","affiliation":[{"name":"Department of Statistics, Fluminense Federal University, Rua Professor Marcos Waldemar de Freitas Reis, s\/n, Niter\u00f3i, Rio de Janeiro 24210-201, Brazil"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2021,12,30]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"656","DOI":"10.1109\/TIT.1983.1056741","article-title":"AUniversal Data Compression System","volume":"29","author":"Rissanen","year":"1983","journal-title":"Trans. Inf. Theory"},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1016\/0005-1098(78)90005-5","article-title":"Modelling by shortest data description","volume":"14","author":"Rissanen","year":"1978","journal-title":"Automatica"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1051\/fopen\/2020013","article-title":"Partition Markov Model for COVID-19 Virus","volume":"3","author":"Tasca","year":"2020","journal-title":"4open"},{"key":"ref_4","unstructured":"Garc\u00eda, J.E., Gonz\u00e1lez-L\u00f3pez, V.A., and Tasca, G.H. A Stochastic Inspection about Genetic Variants of COVID-19 Circulating in Brazil during 2020, AIP Conf. Proc., forthcoming."},{"key":"ref_5","unstructured":"Garc\u00eda, J.E., and Gonz\u00e1lez-L\u00f3pez, V.A. (2011, January 7\u201310). Minimal markov models. Proceedings of the Fourth Workshop on Information Theoretic Methods in Science and Engineering, Helsinki, Finland."},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Garc\u00eda, J.E., and Gonz\u00e1lez-L\u00f3pez, V.A. (2017). Consistent Estimation of Partition Markov Models. Entropy, 19.","DOI":"10.3390\/e19040160"},{"key":"ref_7","unstructured":"Cover, T.M., and Thomas, J.A. (2006). Elements of Information Theory, Wiley-Interscience. [2nd ed.]."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"1098","DOI":"10.1109\/JRPROC.1952.273898","article-title":"A method for the construction of minimum-redundancy codes","volume":"40","author":"Huffman","year":"1952","journal-title":"Proc. IRE"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1214\/aoms\/1177729028","article-title":"The basic theorems of information theory","volume":"24","author":"McMillan","year":"1953","journal-title":"Ann. Math. Stat."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1109\/TIT.1956.1056818","article-title":"Two inequalities implied by unique decipherability","volume":"2","author":"McMillan","year":"1956","journal-title":"IRE Trans. Inf. Theory"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"1581","DOI":"10.1016\/S0898-1221(03)90193-3","article-title":"Block huffman coding","volume":"46","author":"Mannan","year":"2003","journal-title":"Comput. Math. Appl."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1214\/aos\/1176344136","article-title":"Estimating the dimension of a model","volume":"6","author":"Schwarz","year":"1978","journal-title":"Ann. Stat."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"480","DOI":"10.1214\/aos\/1018031204","article-title":"Variable length Markov chains","volume":"27","author":"Buhlmann","year":"1999","journal-title":"Ann. Stat."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"1007","DOI":"10.1109\/TIT.2005.864431","article-title":"Context tree estimation for not necessarily finite memory processes, via BIC and MDL","volume":"52","author":"Talata","year":"2006","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1038\/s41586-020-2008-3","article-title":"A new coronavirus associated with human respiratory disease in China","volume":"579","author":"Wu","year":"2020","journal-title":"Nature"},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"7677","DOI":"10.1002\/mma.6079","article-title":"Partition Markov model for multiple processes","volume":"43","author":"Cordeiro","year":"2020","journal-title":"Math. Methods Appl. Sci."}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/24\/1\/65\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T07:55:51Z","timestamp":1760169351000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/24\/1\/65"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,12,30]]},"references-count":16,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2022,1]]}},"alternative-id":["e24010065"],"URL":"https:\/\/doi.org\/10.3390\/e24010065","relation":{},"ISSN":["1099-4300"],"issn-type":[{"value":"1099-4300","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,12,30]]}}}