0% found this document useful (0 votes)
9 views4 pages

18_EC504A

The document is an examination paper for the course 'Information Theory and Coding' at Narula Institute of Technology, covering various topics such as Hamming distance, Viterbi's algorithm, and cyclic codes. It includes multiple-choice questions, short answer questions, and long answer questions, with a total of 70 marks allocated. The exam is structured into three groups: Group A for multiple-choice questions, Group B for short answers, and Group C for long answers.
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)
9 views4 pages

18_EC504A

The document is an examination paper for the course 'Information Theory and Coding' at Narula Institute of Technology, covering various topics such as Hamming distance, Viterbi's algorithm, and cyclic codes. It includes multiple-choice questions, short answer questions, and long answer questions, with a total of 70 marks allocated. The exam is structured into three groups: Group A for multiple-choice questions, Group B for short answers, and Group C for long answers.
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/ 4

NARULA INSTITUTE OF TECHNOLOGY

An Autonomous Institute under MAKAUT

B.TECH/ECE/ODD/5/EC504A/2020-2021
PAPER TYPE: REGULAR(R18)
YEAR: 2021
INFORMATION THEORY AND CODING
EC504A
TIME ALLOTTED: 3 HOURS FULL MARKS: 70
The figures in the margin indicate full marks.
Candidates are required to give their answers in their own words as far as practicable

GROUP – A
(Multiple Choice Type Questions)
1. Answer any ten from the following, choosing the correct alternative of each question: 10×1=10

SL. NO. Question Marks CO


(i) The hamming distance between 100 and 001 is 1 2
[a] 2 [b] 0 [c] 1 [d] none

(ii) For hamming distance dmin and t errors in the received word, 1 2
the condition to be able to correct the errors is
[a] 2t + 1 ≤ dmin
[b] 2t + 2 ≤ dmin
[c] 2t + 1 ≤ 2dmin
[d] none
(iii) For a (6,4) block code how many errors can be corrected by 1 2
this code?
[a] 0
[b] 1
[c] 2
[d] 3
(iv) H(Y) is minimum when probability of occurrence of input 1 1
symbols are ,
[a] 1.38
[b] 0.5
[c] 755
[d] none of these
(v) In Viterbi's algorithm, the selected paths are regarded as 1 5

[a] survivors
[b] defenders
[c] destroyers
[d] carriers
(vi) In modulo-6 arithmetic, we use only the integers in the range 1 4
[a] 0 to 5
[b] 0 to 6
[c] 1 to 6
[d] None of these
(vii) The divisor in a cyclic code is normally called 1 3
[a] degree
[b] generator
[c] redundancy
[d] none

Page 1 of 4
NARULA INSTITUTE OF TECHNOLOGY
An Autonomous Institute under MAKAUT

(viii) To detect up to 5 errors, the minimum hamming distance in a 1 2


block code must be
[a] 5
[b] 6
[c] 11
[d] none

(ix) The generator polynomial of a (7,4) cyclic code has the 01 4


degree of

[a] 2
[b] 3
[c] 4
[d] 5

(x) Relation between syndrome vector (S) and error vector (E) 01 4
is

[a] S=HTE
[b] S=EHT
[c] none of these
[d] both (a) and (b)

(xi) For a noiseless channel I(X;Y) is 01 1

[a] H ( X ) – H ( Y )
[b] H ( Y ) – H ( X )
[c] H ( X )
[d] H ( X ) – H ( Y/X ).

(xii) Relation between message rate (r) and information rate 01 1


(R) is

[a] C = B (ln2 ( S/N ))


[b] C = B (ln2 ( 1 + S/N ))
[c] C = B/N
[d] C = B2N
GROUP – B*
(Short Answer Type Questions)
Answer any three from the following: 3×5=15
2. Consider 3 stages LFSR with g0=1,g1=0,g2=1,g3=1.Determine 5 5
the output sequence if the input sequence is (1001).
3. Find the generator matrix in systematic form for a (7,4) cyclic 5 3
code with g(x) = 1+x+x3.
3. For a Binary Symmetric Channel, input source alphabet is X = 5 1
{0, 1} with probabilities {0.7, 0.3}; and output alphabet is Y =
{0, 1}.Find the channel matrix.
4. Find out the field elements of GF(23). 5 4

Page 2 of 4
NARULA INSTITUTE OF TECHNOLOGY
An Autonomous Institute under MAKAUT

5. Determine H for (5,3) code and show that GHT=0 & CHT=0 for 5 2
C=(11010)
G=

6. If the information is 1101 for a (7,4) cyclic code then find out 5 3
the codeword in systematic form with g(x) = 1+x+x3

GROUP – C*
(Long Answer Type Questions)
Answer any three from the following: 3×15=45
7. (a) One parity check code has parity check matrix as : 12 2
1 0 1 1 0 0
H1 1 0 0 1 0
0 1 1 0 0 1

i) Determine generator matrix.


ii) Find the code word that begins with [ 101 ].
iii) If received word is [ 110110 ], then decode this word.
(b) State and explain source encoding theorem. 3 2
8. (a) Determine the Shanon Fano code for the following messages 7 1
with the given probabilities: X1 =0.15, X2=0.20, X3 =0.10, X4
=0.05, X5 =0.25, X6 =0.12, X7 =0.13 and find out the Coding
efficiency.
(b) A cable line provides performance of up to 500 MHz. What is 5 1
the SNR in dB required to just adequately transmit at 200
Mbps?

(c) Prove that I(X;Y)= H(X)+H(Y)-H(X,Y). 3 1


9. (a) Find out the minimal polynomial for α4 in GF(23). 6 4
(b) Form the additive group of modulo 7. 5 4
(c) Show that α4 is a primitive element of GF (23). 4 4

10. (a) A (7,3) linear code has generator matrix: 7 2

G=1110100
0111010
1101001
Design the decoder circuit.
(b) Consider (5, 3) code with generator matrix, 8 2
G=

Page 3 of 4
NARULA INSTITUTE OF TECHNOLOGY
An Autonomous Institute under MAKAUT

Express G to standard form and find parity-check matrix.


11. (a) Design a (12, 3) systematic convolutional encoder with a 4+4 5
constraint length v=3 and d*>=3.

i) Construct the trellis diagram for this encoder.

ii) What is the dfree for the code?


(b) Design (2,1,3) convolutional encoder with g1 =[1001], g2 7 5
=[1011] and find the output sequence for input sequence: 101

Page 4 of 4

You might also like