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.

Topics
Data compression, Markov processes
1.
T. M.
Cover
,
Elements of information theory
(
John Wiley & Sons
,
1999
).
Google Scholar
 
2.
D. A.
Huffman
,
A method for the construction of minimum-redundancy codes
,
Proceedings of the IRE
, Vol.
40
(
9
),
1098
–
1101
(
1952
).
https://doi.org/10.1109/JRPROC.1952.273898
Google Scholar
Crossref
Search ADS
 
3.
Jesús E.
García
 and
V. A.
González-López
,
Consistent Estimation of Partition Markov Models, Entropy.
19
(
4
),
160
(
2017
).
4.
G.
Schwarz
,
Estimating the dimension of a model, The annals of statistics.
6
(
2
),
461
–
464
(
1978
).
This content is only available via PDF.
©2023 Authors. Published by AIP Publishing.
2023
Author(s)
You do not currently have access to this content.