Vote count:
0
in Huffman algorithm we form a tree and than replace each character with the tree value of 1 and 0, why don't we simply use the binary digits like a=0,b=1,c=10,d=01,e=11 and so on than replace them with the characters and when decompressing apply the reverse and replace the binary digits with the alphabets like character Huffman-code binary-code a 00 0 b 01 1 c 101 01 and so on
asked 1 min ago
why don't we use simple binary values to compress data
Aucun commentaire:
Enregistrer un commentaire