Explanation Given: Two bits digit are 00 , 01 , 10 and 11 . Concept used: The frequency of occurrence of 0 bit is 0.9 and the frequency of 1 bit is 0.1 . Calculation: The frequencies of the bit string 00 are 0.9 × 0.9 = 0.81 The frequency of bit string 01 are 0.9 × 0.1 = 0.09 The frequency of bit string 10 are 0.1 × 0.9 = 0.09 The frequency of the bit string 11 are 0.1 × 0.1 = 0.01 So, the Huffman code for 00 , 01 , 10 and 11 are 0 , 11 , 100 and 101 respectively To determine (b) Construct a Huffman code for the eight block of three bits. What is the average number of bits required to encode a bit string using this code.

DISCRETE MATHEMATICS-CONNECT ACCESS ONLY

8th Edition

ISBN: 9781264309696

Author: ROSEN

Publisher: MCG

See similar textbooks

Concept explainers

Permutations and Combinations

If there are 5 dishes, they can be relished in any order at a time. In permutation, it should be in a particular order. In combination, the order does not matter. Take 3 letters a, b, and c. The possible ways of pairing any two letters are ab, bc, ac, ba…

Counting Theory

The fundamental counting principle is a rule that is used to count the total number of possible outcomes in a given situation.

Videos

Question

Chapter 11, Problem 39SE

To determine

(a)

Construct a huff man code for the four blocks of two bits 00,01,10 and 11. What is the average number of bits required to encode a bit string using this code.

To determine

(b)

Construct a Huffman code for the eight block of three bits. What is the average number of bits required to encode a bit string using this code.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Chapter 11, Problem 38SE

Chapter 11, Problem 40SE

Students have asked these similar questions

Construct a state-level description (i.e., a state diagram with transitions) for aTuring machine that decides the language {a^(n)b^(2n)c^(n) | n ∈ N}.

Find the sum of products expansion of the function F (x, y, z) = ̄x · y + x · z in two ways: (i) using a table; and (ii) using Boolean identities

The NOR operator, denoted as ↓, behaves as 0 ↓ 0 = 1, 0 ↓ 1 = 0, 1 ↓ 0 = 0,1 ↓ 1 = 0. Show that the any Boolean function over any number of variables can be expressed using onlyNOR operators (in addition to those variables and constants). HINT: Recall that any Boolean function hasa representation as a sum of products expansion

Chapter 11 Solutions

DISCRETE MATHEMATICS-CONNECT ACCESS ONLY

Ch. 11.1 - Prob. 1E Ch. 11.1 - Vhich of these graphs are trees?Ch. 11.1 - Prob. 3E Ch. 11.1 - Prob. 4E Ch. 11.1 - Prob. 5E Ch. 11.1 - Prob. 6E Ch. 11.1 - Prob. 7E Ch. 11.1 - Prob. 8E Ch. 11.1 - Prob. 9E Ch. 11.1 - Prob. 10E

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, subject and related others by exploring similar questions and additional content below.

(a) Construct a huff man code for the four blocks of two bits 00 , 01 , 10 and 11 . What is the average number of bits required to encode a bit string using this code.

Solution Summary: The author calculates the average number of bits required to encode a bit string using the huffman code for 00,01,10and 11.

Concept explainers

Videos

(a)

Construct a huff man code for the four blocks of two bits 00,01,10 and 11. What is the average number of bits required to encode a bit string using this code.

(b)

Construct a Huffman code for the eight block of three bits. What is the average number of bits required to encode a bit string using this code.

Want to see the full answer?

Chapter 11 Solutions

(a) Construct a huff man code for the four blocks of two bits 00 , 01 , 10 and 11 . What is the average number of bits required to encode a bit string using this code.

Solution Summary: The author calculates the average number of bits required to encode a bit string using the huffman code for 00,01,10and 11.

Concept explainers

Videos

(a) Construct a huff man code for the four blocks of two bits 00,01,10 and 11. What is the average number of bits required to encode a bit string using this code.

(b) Construct a Huffman code for the eight block of three bits. What is the average number of bits required to encode a bit string using this code.

Want to see the full answer?

Chapter 11 Solutions

(a)

Construct a huff man code for the four blocks of two bits 00,01,10 and 11. What is the average number of bits required to encode a bit string using this code.

(b)

Construct a Huffman code for the eight block of three bits. What is the average number of bits required to encode a bit string using this code.