Huffman Coding

Resource | v1 | created by janarez |
Edit
bookmark
Type Manual
Created unavailable
Available at engineering.purdue.edu/ece264/17au/hw/HW13?alt=huffman
Identifier unavailable
Description

The description is mainly taken from Professor Vijay Raghunathan. In this assignment, you will utilize your knowledge about priority queues, stacks, and trees to design a file compression program and file decompression program (similar to zip and unzip). You will base your utilities on the widely used algorithmic technique of Huffman coding, which is used in JPEG compression as well as in MP3 audio compression.

Relations

about Huffman coding

In computer science and information theory, a Huffman code is a particular type of optimal prefix cod...

Edit details Edit relations Attach new author Attach new topic Attach new resource
7.0 /10
useless alright awesome
from 1 review
Write comment Rate resource Tip: Rating is anonymous unless you also write a comment.
Resource level 2.0 /10
beginner intermediate advanced
Resource clarity 9.0 /10
hardly clear sometimes unclear perfectly clear
Reviewer's background 3.0 /10
none basics intermediate advanced expert
Comments 0
Currently, there aren't any comments.