Set_Shaping_Theory_Huffman_Analysis_coding_scheme
In this version of the program presented in the following article:
"Practical applications of Set Shaping Theory in Huffman coding" https://arxiv.org/abs/2208.13020
Here you can found the original program: https://www.mathworks.com/matlabcentral/fileexchange/115590-test-sst-huffman-coding
I introduce an analysis about the number of bits needed to reproduce Huffman tree (decoding scheme). This data is fundamental, because it serves to understand that the gain obtained by applying the set shaping theory does not imply an increase in the number of bits necessary to represent the decoding scheme (correspondence between codeword symbols).