Huffman coding based compression, Advanced Statistics

Assignment Help:

Huffman code is used to compress data file, where the data is represented as a sequence of characters. Huffman's greedy algorithm uses a table giving how often each character occurs; it then uses this table to build up an optimal way of representing each character as a binary string. We call the binary string the codeword for that character. A property of Huffman code is that it is a prefix code, i.e., in Huffman coding, no codeword is a prefix of some other codeword. The advantage of prefix code is that it makes decoding easier, as we do not need to use delimiter between two successive codewords. Given the frequency of each of the character, we can devise a greedy algorithm for finding the optimal Huffman codeword of each of the characters. For details of the greedy algorithm,

In this assignment, we will build a compression library that compress text les using Huffman coding scheme. This library will have two programs: compress, and decompress; compress accepts a text file and produces a compressed representation of that text file; decompress accepts a file that was compressed with the compress program, and recovers the original file.


Related Discussions:- Huffman coding based compression

Classification matrix, Classification matrix: A term many times used in di...

Classification matrix: A term many times used in discriminant analysis for the matrix summarizing the results and outputs obtained from the derived classi?cation rule, and obtaine

Probability and random processes, how to find the PDF and CDF of a gamma ra...

how to find the PDF and CDF of a gamma random variable with given equation?

Comparative exposure rate, Comparative exposure rate : A measure of allianc...

Comparative exposure rate : A measure of alliance for use in a matched case-control study, de?ned as the ratio of the number of case-control pairs, where the case has greater expos

Artificial neural network, Artificial neural network : A mathematical arran...

Artificial neural network : A mathematical arrangement modelled on the human neural network and designed to attack various statistical problems, particularly in the region of patte

Factorization theorem, The theorem relating structure of the likelihood to ...

The theorem relating structure of the likelihood to the concept of the sufficient statistic. Officially the necessary and sufficient condition which a statistic S be sufficient for

Bootstrap, Bootstrap : The data-based simulation method/technique for the s...

Bootstrap : The data-based simulation method/technique for the statistical inference which can be used to study the variability of the estimated characteristics of the probability

Gllamm, Gllamm is a program which estimates the generalized linear latent ...

Gllamm is a program which estimates the generalized linear latent and mixed models by the maximum likelihood. The models which can be fitted include structural equation models mul

Banach''s match-box problem, Banach's match-box problem : The person carrie...

Banach's match-box problem : The person carries two boxes of matches, one in his left and one in his right pocket. At first they comprise N number of matches each. When the person

Frequency distribution, The division of a sample of observations into sever...

The division of a sample of observations into several classes, together with the number of observations in each of them.  It acts as a useful summary of the main features of the da

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd