Scribd
Upload
43 views2 pages

Ece07 CT Cia 1

This document contains an exam for the course "Coding techniques" covering information theory and coding methods. The exam contains 8 multiple choice questions assessing 6 course outcomes related to applying data compression techniques, coding methods, linear block codes, and convolutional codes. The questions cover topics like entropy, channel capacity, Huffman coding, error detection/correction codes, and cyclic codes. The exam is worth a total of 50 marks and assesses students at various Bloom's taxonomy levels.

Uploaded by

Karthikeyan Rajamanickam
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
43 views2 pages

Ece07 CT Cia 1

This document contains an exam for the course "Coding techniques" covering information theory and coding methods. The exam contains 8 multiple choice questions assessing 6 course outcomes related to applying data compression techniques, coding methods, linear block codes, and convolutional codes. The questions cover topics like entropy, channel capacity, Huffman coding, error detection/correction codes, and cyclic codes. The exam is worth a total of 50 marks and assesses students at various Bloom's taxonomy levels.

Uploaded by

Karthikeyan Rajamanickam
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/ 2

SAVEETHA SCHOOL OF ENGINEERING

SAVEETHA INSTITUTE OF MEDICAL AND TECHNICAL SCIENCES


DEPARTMENT OF ELECTRONICS & COMMUNICATION ENGINEERING

Sub.Code/Name : EC0703 - Coding techniques


Type of Exam : CIA - I
Duration : 90 mins
Course Outcomes
1. Apply the basics of information theory to calculate channel capacity and other
measures.(1,2)
2. Design specific data compression techniques and calculate the compression achieved (3)
3. Apply and control specific coding methods and be able to calculate the rate and error
probabilities(1,2)
4. Understand the ideas of entropy and information content.(1)
5. Know the practical limitations of data transmission on a given channel(1)
6. Apply linear block codes, convolution codes and cyclic codes for error detection and
correction in various applications (1,2)

Answer all the Questions


S.No Question Marks CO BL PI
1 What is the relationship between uncertainity and
2 1 1 1.3.1
information?
2 Consider a DMS with source probabilities {0.30, 2 3 3 2.2.3
0.25, 0.20, 0.15, 0.10}. Find the source entropy, H(X).
3 The relative entropy or Kullback-Leibler distance
between two probability mass functions p(x) and q(x)
is defined as
 p( x) 
D( p  q )   p ( x) log  
xX  q( x) 
(i) Show that D ( p  q ) is non-negative.
(ii) Show that the Kullback-Leibler distance 10 3 4 1.3.1
does not follow the other two properties of
a distance, i.e., symmetry and the triangle
inequality.
(iii) Show that I ( X ; Y )  D ( p ( x, y )  p ( x ) p ( y )) .
this would elegantly prove that mutual
information is non negative.
4 Consider a DMS with source probabilities {0.35,
0.25, 0.20, 0.15, 0.05}.
(i) Determine the Huffman code for this
source. 10 2 3 2.2.3
(ii) Determine the average length R of the
codewords.
(iii) What is the efficiency  of the code?
SAVEETHA SCHOOL OF ENGINEERING
SAVEETHA INSTITUTE OF MEDICAL AND TECHNICAL SCIENCES
DEPARTMENT OF ELECTRONICS & COMMUNICATION ENGINEERING

5 Show that C = {0000, 1100, 0011, 1111} is a linear 2 3 3 1.3.1


code. What is its minimum distance?
6 State and prove the noiseless Source Coding theorem,
which applies to the codes that satisfy the prefix 8 2 2 1.3.1
condition.
For a (5,3) code over GF (4) , the generator matrix is
1 0 0 1 1 
given by G  0 1 0 1 2 
0 0 1 1 3 
7 6 3 3 2.2.3
(i) Find the parity check matrix for this code.
(ii) How many errors can this code detect?
(iii) How many errors can this code correct?
(iv) How many erasures can this code correct?
(v) Is this a perfect code?
8 Let the polynomial g ( x)  x10  x8  x5  x 4  x 2  x  1
be the generator polynomial of a cyclic code over
GF(2) with block length 15,
(i) Find the generator polynomial G.
(ii) Find the parity check matrix H. 10 6 3 2.2.3
(iii) How many errors can this code detect?
(iv) How many errors can this code correct?
(v) Write the generator matrix in the
systematic form.
Total 50

Bloom's Level Wise Marks Course Outcome Wise Marks


Distribution Distribution
25
Level 1 20
20 18
Level 4 4%
Level 2
20% Level 1 15
16%
Marks

10
Level 2 10
Level 3 5 2
0 0
Level 4 0
Level 3 CO1 CO2 CO3 CO4 CO5 CO6
60% Course Outcomes

You might also like