0
3.3kviews
Explain how Huffman code removes coding redundancies.
1 Answer
0
94views

In binary Huffman code, the code for each symbol will be a combination of ones and zeros. The Huffman code can be represented as a binary tree in which the leaves corresponds to the symbols. The Huffman code for any symbol can be obtained by transversing the tree from root …

Create a free account to keep reading this post.

and 2 others joined a min ago.

Please log in to add an answer.