Wolfram Language Paclet Repository
Community-contributed installable additions to the Wolfram Language
PeterBurbery`Combinatorics`
HuffmanEncode |
|
| | ||||
Details and Options
Examples
(1)
Basic Examples
(1)
Find the Huffman encoding for a string:
In[1]:=
 | HuffmanEncode |
Out[1]=
Symbols{ ,a,b,c,d,e,i,m,n,o,p,r,s,u,y},CodeWords{{0,0,1},{0,0,0,1},{1,0,1,1,0},{1,0,0,0},{1,1,0,1},{1,1,1,0},{1,0,0,1},{1,0,1,1,1},{0,1,0},{1,1,1,1},{1,1,0,0,0},{1,0,1,0},{0,1,1},{1,1,0,0,1},{0,0,0,0}},Encoding{1,0,0,0,1,1,1,1,1,0,1,1,1,1,1,0,0,0,1,0,1,0,1,1,1,0,0,1,1,0,1,1,1,0,0,1,1,1,1,1,0,1,0,0,0,1,1,0,0,1,0,1,1,0,0,1,1,0,1,1,0,0,0,0,1,0,1,1,1,1,1,0,1,1,0,1,0,0,1,1,1,1,1,0,1,0,0,0,1,1,0,1,0,1,1,1,0,1,1,0,1,1,1,0,0,1,0,1,0,1,1,0,1,0,0,0,1,0,1,0,1,0,0,0,0,0,0,0}
Use the function HuffmanDecode to decode the Huffman encoding:
In[2]:=
| HuffmanDecode |
Out[2]=
compression is based on redundancy
In[3]:=
encoded=
["the cat in the hat"]
| HuffmanEncode |
Out[3]=
Symbols{ ,a,c,e,h,i,n,t},CodeWords{{0,0},{1,1,1,1},{1,0,1,0},{1,0,0},{1,1,0},{1,0,1,1},{1,1,1,0},{0,1}},Encoding{0,1,1,1,0,1,0,0,0,0,1,0,1,0,1,1,1,1,0,1,0,0,1,0,1,1,1,1,1,0,0,0,0,1,1,1,0,1,0,0,0,0,1,1,0,1,1,1,1,0,1}
In[4]:=
| HuffmanDecode |
Out[4]=
the cat in the hat
 |
|
 |
|
|
""