1
$\begingroup$

I want to make Huffman coding with Mathematica. I saw a demonstration, but it is not the thing I want to make. I want to show the tree for given string. Here is an example picture:

enter image description here

You can see the demonstration from here. This demonstration looks very atractive but difficult. However, I believe at least, making step by step should be possible.

$\endgroup$
1
$\begingroup$

You can try this link: http://www.davidaltherr.net/mathematics/notebooks/huffman_encoding/huffman_encoding.php

Personally I'm working on another version of step by step Huffman tree encoding but for now I can't associate the tree i get with a binary code yet.

Good Luck!

$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.