Question

In: Other

Find the shortest encoded bit string of the following source sequence: Source sequence: ABCCDEAFABCBEDFABCBBAEFFEBCEFF (a) using...

Find the shortest encoded bit string of the following source sequence: Source sequence: ABCCDEAFABCBEDFABCBBAEFFEBCEFF

(a) using extended Huffman coding to encode the string where k=2


(b) using arithmetic coding.
For this case, you can ignore the termination issue ina a decoder, and output the shortestbit string of the first 5 symbols only, while the probability distribution is based on the whole sequence.


(c) Using adaptive Huffman coding to encode the first 10 symbols of the string. The initial code assignment is given below

  • New : 0

  • A : 00001

  • B : 00010

  • C : 00011

  • D : 00100

  • E : 00101

  • F : 00110

Solutions

Expert Solution

Answer: Following are the LT properties

a) \(P=\varnothing^{\emptyset}\)

b) \(\mathrm{P}=\left\{A O, A 1, A 2 \ldots \in 2 A P w / x O \in A O^{A_{0}}, A_{1}, A_{2} \ldots \in\left(2^{A P}\right)^{w} \mid x_{0} \in A_{0}\right\}\)

c) \(\mathrm{P}=\left\{A O, A 1, A 2 \ldots \in 2 A P w / x O \notin A C A_{0}, A_{1}, A_{2} \ldots \in\left(2^{A P}\right)^{w} \mid x_{0} \notin A_{0}\right\}\)

d) \(P=\left\{A O, A 1, A 2 \ldots \in 2 A P w / x O \notin A O \wedge \exists A_{0}, A_{1}, A_{2} \ldots \in\left(2^{A P}\right)^{w} \mid x_{0} \notin A_{0} \wedge \exists_{i}:(x>i) \in A_{i} \wedge i>0\right\}\)

e) \(\mathrm{P}=\left\{A O, A 1, A 2 \ldots \in 2 A P_{W} A_{0}, A_{1}, A_{2} \ldots \in\left(2^{A^{p}}\right)^{w} \mid \exists_{i} \geq \geq 0: \forall j \geq i,(x>i) \notin A_{j}\right\}\)

f) \(P=\left\{A O, A 1, A 2 \ldots \in 2 A P w^{A_{0}}, A_{1}, A_{2} \ldots . \in\left(2^{A P}\right)^{w} \mid \forall i \geq 0: \exists_{j} \geq 1,(x>i) \in A_{j}\right\}\)

g) \(P=\left\{A O, A 1, A 2 \ldots \in 2 A P w^{A}_{0}, A_{1}, A_{2} \ldots . \in\left(2^{A P}\right)^{w} \mid \forall(x=0)^{\forall}(x=0) \in^{\epsilon} A_{1} A_{i} \wedge^{\wedge}(x>1) \in^{\epsilon} A i+1^{A}_{i+1} \wedge^{\wedge} i m o d z^{m o d}_{2}\right.\)

\(=0\) ) \(v\)

h) \(\mathrm{P}=2 \mathrm{APW}^{\left(2^{A P}\right)^{w}}\)

Safety property is a behavior in which "nothing bad happens".

Here, \(d, g\) is a safety property, as a bad prefix is for instance.


Related Solutions

Suppose that you pick a bit string from the set of all bit strings of length...
Suppose that you pick a bit string from the set of all bit strings of length ten. Find the probability that the bit string has exactly two 1s; the bit string begins and ends with 0; the bit string has the sum of its digits equal to seven; the bit string has more 0s than 1s; the bit string has exactly two 1s, given that the string begins with a 1.
Write a program sequence that will test the byte STATUS and branch to ROOTINE_1 if bit...
Write a program sequence that will test the byte STATUS and branch to ROOTINE_1 if bit 1, 2 or 4 is 1. Otherwise, it is branch to ROUTINE_2 if both bits 1 and 3 are 1 and to ROUTINE_3 if both bits 1 and 3 are 0. In all other cases it is to exeute ROUTINE_4. Assume that the routines are more than 128 bytes long. Also give a flowchart of the sequence.
Decide whether following sequence is an A.P., if so find the 20th term of the progression.
Decide whether following sequence is an A.P., if so find the 20th term of the progression.–12, –5, 2, 9, 16, 23, 30,...
Using STL stack class, implement in C++ the following pseudocodefunctioncheckBraces(aString: string) that checks for...
Using STL stack class, implement in C++ the following pseudocode functioncheckBraces(aString: string) that checks for balanced braces { } in a given string /arithmetic expressions. Write a main() program to test the function.// Checks the string aString to verify that braces match.// Returns true if aString contains matching braces, false otherwise.checkBraces(aString: string): boolean{aStack = a new empty stackbalancedSoFar = truei =0// Tracks character position in stringwhile (balancedSoFar and i < length of aString) {ch = character at position i in...
Design a state diagram that detects the 7-bit ASCII code of the last alphabet of your full name from a sequence of incoming bits
Design a state diagram that detects the 7-bit ASCII code of the last alphabet of your full name from a sequence of incoming bits. Derive the truth table and draw the circuit diagram of this system using D-Flip Flops. Note: “Muhammad Ali” than you have to detect ASCII code for “i”. Note : Do this for "i"
Find the following values, using the equations, and then work the problems using a financial calculator...
Find the following values, using the equations, and then work the problems using a financial calculator to check your answers. Disregard rounding differences. (Hint: If you are using a financial calculator, you can enter the known values and then press the appropriate key to find the unknown variable. Then, without clearing the TVM register, you can "override" the variable that changes by simply entering a new value for it and then pressing the key for the unknown variable to obtain...
Find the following values, using the equations, and then work the problems using a financial calculator...
Find the following values, using the equations, and then work the problems using a financial calculator to check your answers. Disregard rounding differences. (Hint: If you are using a financial calculator, you can enter the known values and then press the appropriate key to find the unknown variable. Then, without clearing the TVM register, you can "override" the variable that changes by simply entering a new value for it and then pressing the key for the unknown variable to obtain...
Find the following values using the equations and then a financial calculator.
Find the following values using the equations and then a financial calculator. Compounding/discounting occurs annually. Do not round intermediate calculations. Round your answers to the nearest cent.a. An initial $400 compounded for 1 year at 7%.b. An initial $400 compounded for 2 years at 7%c. The present value of $400 due in 1 year at a discount rate of 7%.d. the present value of $400 due in 2 years at a discount rate of 7%
Find the first five terms of the following sequence, starting with n=1. an=−4n−3 Give your answer...
Find the first five terms of the following sequence, starting with n=1. an=−4n−3 Give your answer as a list, separated by commas. For example, if an=n, you would give your answer as 1,2,3,4,5.
Define a schedule risk factor using a credible source.
Define a schedule risk factor using a credible source.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT