Huffman coding is "simple", but building it is complicated (trees).
Huffman coding just converts "bytes" to variable length data (different length in bits).
For example: text ABCCC could convert to bits "0" "10" "11" or "1" "00" "01"
Because it convert each character to same "bits character", you could see patterns if you see data as bits.
Do not study it much, try find some tools, and try if it work.
It may be some modified Huffman coding, or something different.
I never used any program for Huffman coding, so I know only that QuickBMS have some support,
and there are online "Huffman coding visualization", "Huffman coding encoder", "Huffman coding calculator"
For example:
http://huffman.ooz.ie/?text=ABCCChttps://resources.nerdfirst.net/huffman