lo.

-506C/5CS6.3
B.Tech Fifth Semester Main/Back Examination, January- 2021
(Computer Science Engineering)
Information Theory and Coding
03:00Hours Maximum Marks: 70
Min. Passing Marks: 21

1. The paper isdivided into three parts, i.e. Part-A, Part-B, Part-C.
2. Part-A contains 10 questionsand carries one markseach.
3. Part-B contains 05 questions. Each question is having two options and
carries 8 marks each.
4. Part-Ccontains 04 questions. Attempt any two questions and carries
10 marks each.

PART-A

Q.1
A. Define Entropy.
B. Define Source Coding Theorem.
C. Define prefix code.
D. Define channel capacity.
E. Define Syndrome.
F. Write formula for minimum distance and define terms used.
G. Define Generator Matrix.
H. Define parity code.
I. Define convolution code.
J. Define use of tree diagram.
PART-B

Q.2 Prove that H become maximum when message M (mË, m) are equally likely
probable.
OR

What do you mean by Discrete Memoryless Channel? Explain various types of

DMCs.

Q.3 Explain Lempel Ziv coding with an example.

OR

For agiven message sequence X={'a, b, e', d, 'e, 'r }the given probabilities are
P={0.13, 0.1, 0.03, 0.15, 0.18, 0.41 }. Construct Shannon fano and Hufinan code
and compare efficiency.
 by the generator matrix
Q.4 C'onsider a (6.3) linear block code delined

Find theparity check matrix of tbe

(a) Determine if thc code isa lHamming code.
in systematic fornm.
code.
(b) Findthe cncoding table for the linear block
errors can the cod.
(c) What is the minimum distance dmun of thc code? IHow many
detect? How many errors can the code corrcct?

(d) Draw the hardware encoder diagram.

(e) Find the decoding table for the linear block code.
()Draw the hardware syndrome generator diagram.
Q.5 The parit check matrix of a particuiar (7.4)lincar block code is expresscdas

[H) =
1 0

a Obtain Generator matrix G

b LiN all the code vectors.
C Minimum distance between code vectors.
d. HoW many errors can be detected and corrected.

Q.6 Explain the designing process and requirements of Convolutionencoder. Also draw
Encoder diagram.
PART-C

Q.7 Draw the Encoder diagram, Tree Diagram, Trellis Diagram of given convolution code
parameters.
Message bit: 10101
gi(x): x'+x+|
g2(x): x+1
gi(x): x+x

Q.8 Write short note BCH or RS code.

Q.9 What do you mean by S/N Tradeoff? Prove that C,= L44
O 10 for a given linear block code prove that S=EH
 ROLL NO..
5CS6.3
B.Tech. ithSeaester Sumnmer Back
Exumination, Deeember 2020
Information Theory &Coding
Computer Seience E:ngineering
Time: 03:00 Hrs.
Max Marks: 70

Min, I'assing Marks: 21

Q.1 Define Information, Information Rate, and Average

infonation and Code length.
OR
What do you mean by Channcl bandwidth? Prove that Co L44

Q.2 Calculate Entropy, Average Code word length and eficieney of a given event of probabilities
using Huffman code. 1/100, 1/100, 3/20, 3/20, K, /50, 2nS, 225

OR
Explain Lempel Ziv coding with a known source code.

Q.3 Explain various types of errors andcodes used in communication.

OR
Write short note on lincar block codes.

Q.4 What do you nean by Cyclic Code. lixplain Eincoder designing process in details.
OR

Briefly explain BCl or RS code.

Q.5 Creatc code trec and state diagram and trec diagram for any convolution code.
OR

alyonthn and its diagan

What do you mean by Viterbi Decoder? Bricly cxplainthe Viterbi
 R Tech. iNh Semexter Main/Buck Examination,November-2017
(Branch:(omputer Seience&Engineerin)
Informatlon Theory & Coding
Maximum Marks: 70

Min. Passing Mark: 21

\Cmtany tive quesions, One question from each unit

\ll quesioncany cqual marks,
SNfennalic diagrams must be shown where necessary.
A data voufeel missing may suitably be assumed and stated clearly.
Unit-I

laonr the ditterent properties of Entropies.

)Show that tor a discrete binding channel:
H(N, Y) - H(X/Y) +H(Y)
H(X, Y) -H(X)+H(Y)
OR
Pl=/.P2=1/2. Find out
a)cnsider aDMS withthe alphabet (S0, SI, S2) with probabilities P0=|/2,
entropy?
the entnpy of the original source and sccond ordor extension
b) Write short note on "Mark Off Process".
UNIT II
expression to define channel capacity of aGaussian channel. What do you undeisiand
(a)Derive an
h Rondwidth, SN tade-oft.
procedure for the following message.
b) Applvthe Shannon - Fano Coding x4 x7
N3
I/16 1/I6 I/16 |/4 1/16 I/8
Ipl /4 I8
OR

symmetric channel
rocedure lor evaluation of the channel capacity of a binary having the noise
?a) Descube the method to ind the channel capacity of the channel
ested by S. Muropa, Apply the
hatiN with probabilities.
with example.
) What is prelis code ? Explain
UNIT III

and classilication of codes.

errors
0)ain pes of
the(1Dlincm
nsiler Code wosegencralor
matrix is
 (a) Find all the code vectors of this code
(b) Find the panty check matrix for this code
(c) Find the m1nimumwcight of this code.
(d) Provc cquation CH-0 OR
error-controlproblem:
Discuss the following methods for solvingthe
a)
() Automatic-Repcat Request (ARQ) (FEC)
(ii) Feed-Forward Emor Correction
b) Consider a (7, 4)block code geheratcd by
1 0 0 0

0 1 0 0 1 10

1 01

0 0 0 1

suppose that the received vector R is 1001001.

Find out the error vector and

UNIT IV
operation ne
an encoder for (7, 4) BCC gencratcd by g(x) : l+xtx and verify its
Q. 4 a) Design
Imessage vector 0101
properties of Galois fields.
(b)What isGaiois field? Explain OR
the
for the given generator polynomial G(P) =P+P+l and find
Q.4 a) Determine the generator matrix
code word for the message M=1011. GF(3).
b) Thefollowing polynomial(x) and g (x) are defined over
f(x)= 2+x+x'+2x*
g(x): 1+2x'+2x*+x
poiynomials.
Caleulate addiisn and multipiication ofthe abovè lwo

UNIT V
0.5 Write short notes on :
codes
(i) Maximum likelihood decoding of convolution
(ü)Describe Viterbi algorithm.
OR
code.
Q.5 a) Compare Linear block code and convolution
decoding of convolution codes.
b)Write short note on Maximum likelihood