0% found this document useful (0 votes)
56 views

Di Print

This document is a test on digital video coding from an instructor named Prof. K.R. Rao. It contains multiple coding questions including determining uniquely decodable codes, identifying prefix codes, calculating average code length using Huffman and minimum variance Huffman coding, encoding and decoding sequences with errors, finding real valued tags, and encoding a message using Lempel-Ziv coding.

Uploaded by

Mcs Candra Putra
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
56 views

Di Print

This document is a test on digital video coding from an instructor named Prof. K.R. Rao. It contains multiple coding questions including determining uniquely decodable codes, identifying prefix codes, calculating average code length using Huffman and minimum variance Huffman coding, encoding and decoding sequences with errors, finding real valued tags, and encoding a message using Lempel-Ziv coding.

Uploaded by

Mcs Candra Putra
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 9

6 : 0 ~ - 7 ' , 3 0p p /

DIGITAL VIDEO CODING


TEST # 1
DATE : 1 -/d.+
INSTRUCTOR: - Prof. K.R.RAO
.-

6:/

i[ )I:

h*

)I,.+

*.

_. -

AU ~ A L + dA
a' ev+
lcPd.
No 7of~ki.l M a h k c J h

&

c b ~ e drn

1 a) Determine whether the following codes are uniquely decodable. Justify your
answerh,

b) Of the following codes, find which are Prefix codes. Justify your answers.
Symbol

a)
b)
c)
d)

Symbol

Code 1

Code 2

Code 3

Code 4

Probability

Find Huffrnan Code and get its average code length.


Find Minimum Variance Huffman Code and get its average code length.
Find the Redundancy.
Encode the sequence: - SS
,S
IS
,2S1S,
Using Huffman and Minimum Var~anceHuffman Code.
Now, suppose the first bit is received in error at the receiver.
Decode using both Huffman and Minimum Variance Huffman c o d e d
How many characters are received in error before the first correctly decoded
character in each case?

3 Given the probability model in the following table, find the real valued tag for the
Sequence
SiSi3StS3Sr
Letter
ss

sa

S3

Probability
0.2
0.3
0.5

4 Given an initial dictionary consisting of letters " a b r y#" , encode the following

message using UW algorithm: - a ) f b a r p a r r a y j f b y y b a r r a y a rflb a y


Index

Entry

'BL,J

~r y

bp

~Ilm9-i.

6J-

{I,;,

r h ~ 4~bill?>
d

cue

p v o ~ c ~ ad
B

40)
q)
1,

lo, 0 ,

'WS4
pi.!..!o tS3
3

VtL

ay
9%

!b

r y.b
bar
Y I

You might also like