Question 3 Let be the discrete source on the alphabets (S, A, D, Y which defines a series of 5 possible characters. These characters occur with probabilities of: S = 0.1, A=0.2, D=0.4. Y=0.2. and-0.1. a) Encode the Word "DAYS." using arithmetic coding compression. b) Find the output codeword. c) Find the number of bits/ symbol in this encoding technique. d) Show how your solution would be decoded.

Question 3 Let be the discrete source on the alphabets (S, A, D, Y which defines a series of 5 possible characters. These characters occur with probabilities of: S = 0.1, A=0.2, D=0.4. Y=0.2. and-0.1. a) Encode the Word "DAYS." using arithmetic coding compression. b) Find the output codeword. c) Find the number of bits/ symbol in this encoding technique. d) Show how your solution would be decoded.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

QUESTION 19 Given that the following is a series of 8 LED lights Ω ΩΩ ΩΩΩΩΩ And Convert 127 from decimal to an 8 bit binary representation by selecting all the lights that would be lit (on). 27 26 25 24 3 22 21 2 128 64 32 16 8. 4 1
1. Let M be the plaintext message M = MALAYSIA and the private key, K = ISSOGOOD, Supposed we using the appropriate steps of DES operation and the permutation compression (PC) table provided below get he final output of the key for round 1. a) Based on the output above, explain the next process using the S-box table, and show the output from this operation. b) Based on the output above, explain the next process using a straight permutation table, and show the output from this operation.
Using the Huffman Algorithm, encode the following string “Dear Asiamah,”. Where Surname is your official or formal registered Surname as a student in GCTU. Determine (a) The Huffman-tree. (b) The Huffman-code (c) The average code length of bits saved. (d) The proportion or percentage of bits save when variable-length encoding is used instead of fixed length encoding scheme.
Map the Hamming distance and maximum correctable bits to the following encodings (b = binary, h = hexadecimal). 1. Correctable errors from (00h→0b), (FFh→1b) answer: 1/2/3/4/5/6/7/8/9 2. Hamming distance from (00h→0b), (FFh→1b) answer: 1/2/3/4/5/6/7/8/9 3. Hamming distance from (00h→00b), (0Fh→01b), (F0h→10b), (FFh→11b) answer: 1/2/3/4/5/6/7/8/9 4. Correctable errors from (00h→00b), (0Fh→01b), (F0h→10b), (FFh→11b) answer: 1/2/3/4/5/6/7/8/9
QUESTION 11 Given that the following is a series of 8 LED lights Ω ΩΩ ΩΩΩ ΩΩ And Convert 1 from decimal to an 8 bit binary representation by selecting all the lights that would be lit (on). 27 26 25 24 3 22 21 2 128 64 32 16 1
3. So I am studying Word Aligned Hybrid compression. All of it seems pretty straightforward until I stumbled upon the last part. Say you have a 8-bit compression but you only have for example 2, 3, 4, or some number of bits less than the word size. how do you "compress" or rack on the remaining bits? say we are doing a size 8 on the example: 0101000-00000000-00000000 I understand that the first 7 are taken literally then there follow 2 runs of 0's. But then what do you do about the remaining 3 or so bits? what would the compressed output look like?
DO NOT COPY FROM OTHER WEBSITES Correct and detailed answer will be Upvoted else downvoted. Thank you!
5
LZW coding: we have a word of length 1000, containing these letters with its probabilities: p(a)=0.5, p(b)=0.2, p(c)=0.15, p(d)=0.15 we need 2 bits to represent each letter, so the word requires 2000 bits. using lzw algorithm we decompressed to about 1850 bits, and our compression ratio is 2000/1809 = 1.105 Does this solution seem correct/good?