Scribd
Upload
45 views2 pages

CT-Problem-sheet-6

Uploaded by

sivasrisvoc
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
45 views2 pages

CT-Problem-sheet-6

Uploaded by

sivasrisvoc
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

EC3021D Information Theory and Coding

Problem Sheet-6

Dr. Nujoom Sageer Karat

06-02-2025
Based on Lec-11 and 12

1. (Topic: Standard Array decoding) Consider the following generator matrix over F2 ,
(assume the transmissions over the binary symmetric channel of cross-over probability
p)  
1 0 0 1 0
G = 0 1 0 0 1
0 0 1 1 1
(a) Generate all possible codewords using this matrix.
(b) Find a parity check matrix H.
(c) Construct a standard array for this code.
(d) What is the minimum distance of this code?
(e) How many errors can this code detect?
(f) How many errors can this code correct?
(g) What is the probability of undetected error for this code?
(h) Based on the standard array, find the probability of decoder error.
(i) Write the syndrome-coset leader map for this code.
(j) If the received vector is 11010, to which codeword is it mapped to?
2. (Topic: Syndrome Decoding of Hamming Code) Give a systematic parity check matrix
H of a [7, 4]-Hamming code and answer the following:
(a) Give the corresponding generator matrix G.
(b) What is the minimum distance of the code?
(c) Write the error-correction and error-detection capability of this code.

1
(d) Write the syndrome-coset leader map table for this code (without considering the
standard array).
(e) Can it correct any error pattern with two errors?
(f) If the received vector is 1100000, find the estimated codeword.
(g) Find the probability of undetected error and decoder error considering transmis-
sions over BSC(0.001).
3. (Topic: Syndrome decoding) Consider the [15, 11, 3] Hamming code.
(a) Give a parity check matrix H for the code.
(b) Encode the message 11111100000.
(c) Decode 111000111000111 by syndrome decoding without constructing the stan-
dard array.
(d) Write the probability of codeword error (decoder error) for this decoder (assume
transmissions over BSC (p)).
4. (Topic: Subcode) Consider an [n, k] code C whose generator matrix G contains no zero
column. Arrange all the codewords of C as rows of a 2k × n array.
(a) Show that no column of the array contains only zeros.
(b) Show that each column of the array consists of 2k−1 zeros and 2k−1 ones.
(c) Show that the set of all codewords with zeros in a particular component position
forms a subspace of C. What is the dimension of this subspace?

You might also like