Group 3 - Huffman coding is an entropy encoding algorithm...

Info iconThis preview shows pages 1–6. Sign up to view the full content.

View Full Document Right Arrow Icon
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Huffman coding is an entropy encoding algorithm used for lossless data compression . Huffman’s algorithm is an example of a greedy algorithm. Greedy algorithm: an algorithmic technique to solve optimization problems Always makes the choice that looks best at the moment. Makes a locally optimal choice in the hope that this choice will lead to a globally optimal solution Once a choice is made the algorithm never changes its mind or looks back to consider a different perhaps better solution; the reason the algorithm is called greedy. The overall time complexity of Huffman's algorithm
Background image of page 2
Huffman coding is widely used and very effective technique for compressing data; savings of 20% to 90% are typical, depending on the characteristics of the file being compressed. Huffman coding involves the use of variable- length codes to compress long strings of text. By assigning shorter codes to more frequent characters, Huffman encodings can compression text by as much as 80%.
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 4
While a Ph.D. student at
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 6
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 14

Group 3 - Huffman coding is an entropy encoding algorithm...

This preview shows document pages 1 - 6. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online