Trosiki Pettis |
Name: Trosiki Pettis
SCHOOL: Alcorn State University MAJOR: Computer Networking/ Advanced Technology MENTOR: Dr. Lei Cao EXPECTED GRADUATION DATE: May 2006 ORGANIZATIONS & HONORS: • Alcorn State University Football TeamEmail: TrosikiPettis@yahoo.com Trpettis@olemiss.edu |
ABSTRACT
Huffman Code for Data Compression and Error Propagation
| This paper studies the basic concepts behind the Huffman encoding and
decoding algorithm. This paper demonstrates how to perform simple operations
that are vital to the Huffman encoding and decoding process. This
paper will also illustrate how to calculate the symbol probabilities that
are required to construct the Huffman tree. Also this paper will discuss
how codeword are assigned to each individual symbol that appears in a symbol
sequence. We will illustrate how data is encoded and decoded. Within this
paper we will study the algorithm used to measure error propagation duration
of the Huffman coding algorithm, meaning we will study how many symbol
errors occur in the symbol sequence due to a one bit error within the bit
sequence. This paper presents the results of our studies and offers suggestions
for future research in this particular area.
|