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.

8th Edition

ISBN: 9781264309689

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

03: Let V = H(n), n≤ R, a(u,v) = (f, v) a(u,v) = Vu. Vv dx, and (f,v) = (a) Show that the finite element solution un unique. (b) Prove that || ≤ch ||||2 الكاملا (c) Given the triangulation of figure, determine the basis function and compute the integrals: So 4 dx, Sox where a (u,v) >, & ill 2 fvdx, v .V, dx. (0,1) V. V dx., SV. Vz dx. (0,0) (1,0)

The general solution of the linear system X' = AX is given. A = = (³ -2). x(t) = c₁ c₁(1) et. et + c₂ e-t 3 3 (a) In this case discuss the nature of the solution in a neighborhood of (0, 0). O All solutions become unbounded and y = 3x serves as the asymptote. O All solutions become unbounded and y = x serves as the asymptote. If X(0) = X lies on the line y = x, then x(t) approaches (0, 0) along this line. Otherwise X(t) becomes unbounded and y = 3x serves as an asymptote. If X(0) = X lies on the line y = 3x, then x(t) approaches (0, 0) along this line. Otherwise x(t) becomes unbounded and y = x serves as an asymptote. O All solutions spiral toward (0, 0). (b) With the aid of a calculator or a CAS, graph the solution that satisfies X(0) = (1, 1). 2 1 (1, 1) x -2 -1 1 2 4 -2 2 1 (1, 1) 4 2 -2 (1, 1) 2 x 4 -4 i 2 (1, 1) 1 x 1 2 2 1 1 2 x

Q2: Consider the problem -((1+x)) = 0. x1 = [0, 1]. u(0) = 0, u'(1) = 1 Divide the interval / into three subintervals of equal length h -1/3 and let V), be the corresponding space of continuous piecewise linear functions vanishing at x = 0.1. Find the variational form and finite element method Verify that the stiffness matrix A is given by: 16 1 -9 A = = 20 0 -11 11 Q2: A: Consider the problem -Au+&u= f Χ Ε Ω, δ > 0 Χ Ε ΘΩ Show that a(u, v) is continuous and V-elliptic. B: Consider the model problem -u" f, xE 1 = 10, L. u(0) = u(L) = 0 Prove that u E Vo is solution of variational formulation if and only if its solution of the minimization problem F(u) ≤ F(w) where F(w), w² dx - , fwdx

Chapter 11 Solutions

DISCRETE MATHEMATICS LOOSELEAF

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.