ASHOKA INSTITUTE OF TECHNOLOGY AND MANAGEMENT, VARANASI
ASSIGNMENT 2
Course & Branch: B.Tech, ECE Subject Name: Information Theory & Coding
Semester: VII Subject Code: BEC-072
Assignment Given on- Assignment Submission Date –
Name of the Faculty – Mr. Pradeep Kumar Verma Session: 2025-26
S. No. Questions Marks CO BL
Note: Attempt all questions. Each question carries equal mark.
2(a) 2 3 K2
State and prove channel coding theorem. Explain
Jointly Typical sequences.
2(b) 2 3 K2
Explain the following: -
(i) Noiseless binary channel
(ii) Noisy channel with non-overlapping outputs
(iii) Noisy typewriter
(iv) Binary symmetric channel
(v) Binary erasure channel
Symmetric channels
Consider a (6,3) linear block code whose generator matrix is 2 4 K3
2(c)
[ ]
1 0 0 1 0 1
given by 0 1 0 1 1 0
0 0 1 0 1 1
(i) Find the parity check matrix.
(ii) Find the minimum distance of the code.
(iii) Draw the encoder and syndrome computation circuit.
2(d) A (6,3) linear block code is generated by the generator 2 4 K3
matrix G given as
[ ]
10 0 1 0 1
G= 0 10 0 1 1
0 0 11 1 0
For a particular codeword transmitted, the received codeword
is (100011). Find the corresponding data-word transmitted.
2(e) For the convolutional encoder shown 2 5 K3
S1 S2 S3
+ +
(a) Draw the state and trellis diagrams and determine the output
digit sequence for the data digits 11 01 01 00.
(b) Use Viterbi’s algoritm to decode the following received
sequences:-
(i) 110 110 111 101 001 101 001 010
2(f) Discuss the following:-
(ii) 010 110 111 101 101 101 001 010 2 5 K2
(i) BCH codes.
(ii) RS codes.
(iii) Golay codes.