--- schemes compress data in a way that does not guarantee that all of the information in the original data can be fully and completely recreated. Randomized compression Decompression Lossy compression Repeat sampling
Added by Timothy C.
Close
Step 1
Step 1: The question asks to identify the type of compression scheme that does not guarantee the full recreation of the original data after compression. Show more…
Show all steps
Your feedback will help us improve your experience
Madhur L and 66 other AP CS educators are ready to help you.
Ask a new question
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Key Concepts
Recommended Videos
Madhur L.
2. (20 points) State whether the following statements are true or false. (a) ( )The channel coding reduces bit errors by increasing the signal to noise ratio of the received signal. (b) ( )The proper choice of a source coding algorithm depends upon the properties of what is to be encoded. (c) ( )Lossy compression reduces the effects of bit errors. (d) ( )Information is lost or discarded inside the Huffman Coding stage used in MP3 coding. (e) ( )Information is lost or discarded inside the non-uniform quantization stage used in MP3 coding. (f) ( )I(X; Y) ≤ H(Y). (g) ( )If E(X) ≥ E(Y), then H(X) ≥ H(Y). (h) ( )If X and Y are independent, then H(X|Y) = H(Y|X). (i) ( )If Y = 2^X, then H(Y) = H(X). (j) ( )If Y = sin(X + a), where a is a constant, then H(X) ≥ H(Y). 3. (30 points) Short questions (Note that you are required to answer the questions briefly.) (a) What is the chief concern of information theory? State the two fundamental questions in communication system that information theory deals with and answer the two questions. (b) State the channel coding theorem and the objective of channel coding.
Adi S.
Let S1 be a source which outputs independent letters from the alphabet A = {a, b, c, d, e} with probabilities pa = 1/8, pb = 1/16 pc = 1/2 pd = 1/4 and pe = 1/16. Let S2 be a source which outputs independent letters from the alphabet Z = {w, x, y, z} with probabilities pw = 1/4, px = 1/4 py = 1/4 pz = 1/4. Suppose one wants to compress the random sequence coming out of these sources. Which source can be compressed to shorter code in average?
Jacob M.
Recommended Textbooks
Computer Science and Information Technology
Introduction to Programming Using Python
Computer Science - An Overview
Transcript
18,000,000+
Students on Numerade
Trusted by students at 8,000+ universities
Watch the video solution with this free unlock.
EMAIL
PASSWORD