Purchase Solution

Data encoding and decoding using Huffman codes

Not what you're looking for?

Ask Custom Question

Using the Huffman code given in the attached image,

(a) encode the string "NEEDLE".
(b) decode the bit string "01111001001110".

Attachments
Purchase this Solution
Solution Summary

Solution also explains the process, following which you can easily handle other string encoding and bit string decoding problems with huffman code tree.

Solution Preview

(a) To find the Huffman code for a letter, we need to put together the edge labels in order of traversal from root to the leaf node marked with the respective letter.

Which gives ...

Purchase this Solution
Free BrainMass Quizzes
Know Your Linear Equations

Each question is a choice-summary multiple choice question that will present you with a linear equation and then make 4 statements about that equation. You must determine which of the 4 statements are true (if any) in regards to the equation.

Exponential Expressions

In this quiz, you will have a chance to practice basic terminology of exponential expressions and how to evaluate them.

Multiplying Complex Numbers

This is a short quiz to check your understanding of multiplication of complex numbers in rectangular form.

Geometry - Real Life Application Problems

Understanding of how geometry applies to in real-world contexts

Graphs and Functions

This quiz helps you easily identify a function and test your understanding of ranges, domains , function inverses and transformations.

View More Free Quizzes
Related BrainMass Solutions

  • Lossless Text Data Compression

    In this way, both the encoder and decoder use the same codebook without ever having to transmit the codes with the data. 1.1.1 Huffman Coding In 1952, D. A.

  • Coding

    And since each combination is unique over the other, the decoding process is much lesser prone to errors and wrong interpretation of codes. This posting contains answers to the given questions.

  • Decoding of Binary Information and Error Correction (VI)  

    This solution explains the problems of decoding of the binary informations and error correction.The solution is given in detail. This is mainly for solving the problem of transmission of data and that of receiving the data in computer science.

  • Huffman tree

    The total length of the encoding with the above frequencies and the derived Huffman tree is: Answers: a) 62 b) 63 c) 64 d) 30 e) 31 Thanks Annie The Huffman tree will be the following

  • Encoding & Decoding using mono-alphabetic cipher

    125929 Encoding & Decoding using mono-alphabetic cipher Using the mono-alphabetic cipher in Figure 8.3 in the textbook *, encode the message "I am a student of MSc IT". Decode the message "s vk jku uasjf ik".

  • Decoding of Binary Information and Error Correction (V)

    This solution explains the problems of decoding of binary information and error correction. The solution is given in detail. This is mainly for solving the problem of transmission of data and that of receiving the data in computer science.

  • Draw the waveforms using different encoding schemes.

    The resulting 5-bit codes are then sent using NRZI. The 5-bit codes for our data are as below (kindly confirm these with standard reference).

  • Decoding of Binary Information and Error Correction (III)

    This is mainly for solving the problem of transmission of data and that of receiving the data in computer science.

  • Mathematics - Algebra - Word Problem

    To your surprise, you find several very useful applications, such as decoding and encoding messages, and decide to discuss two that you feel are important to the class.

View More Related Solutions