EE5160 - Error Control Coding

Tutorial - Week 02

February 15, 2021

1. (a) Find a (28, 23, 3) binary linear code.

(b) Find a rate - 4/5 binary linear code with minimum distance 4.
Hint: Use extension.
(c) Obtain a rate - 5/6 binary linear code using hamming codes i.e.
(2r − 1, 2r − r − 1, 3) codes.
2. Give two examples of perfect binary linear codes.
Hint: Codes that satisfy the hamming bound are called perfect codes.
 
1 1 0 1 1
3. (a) Let G = 1 0 1 1 0 be the generator matrix of a linear binary
0 1 0 1 0
code C1 .
Find n, k, d for the code.
Let ci1 ci2 . . . cik be the positions or indices (in each codeword) that
have a one-one map with the message. Give two examples of ci1 ci2 . . . cik
for the above code. Give a set of indices that cannot be ci1 ci2 . . . cik
for the above
 code. 
1 1 0 0 0 1 0 1
0 1 0 1 1 0 0 1
(b) Let H =  1 0 0 1 0 0 1 1 be the parity matrix of a bi-


0 1 1 0 1 1 0 0
nary linear code C2 .
Find n, k, d for the code.
Give two sets of columns in H that have a one-one map with the
parity bits. Give a set of columns that do not have a one-one map
with the parity bits.
(c) Change a single column of the parity check matrix H above so that
the minimum distance becomes d − 1.
4. Consider extending an (n, k, d) binary linear code by adding an overall
parity check bit to each codeword.
(a) Specify parameters of the new code.

1
 (b) Specify the generator matrix and parity check matrix of the code
obtained by extending the (7, 4, 3) Hamming code.
5. Can you puncture the (7, 4, 3) Hamming code in any one position to get
a code with minimum weight 3? If not justify.

6. Consider the (7, 4, 3) Hamming code C. Throw away all odd-weight code-
words from C to get a set S. Is S a linear code? If so, find its parameters.
7. Consider two binary linear codes C1 , C2 with parameters (n, k1 , d1 ) and
(n, k2 , d2 ) and generator matrices G1 and G2 respectively. Consider the
code defined by, C = {(u, u + v) : u ∈ C1 , v ∈ C2 }. Find the parameters
of C. Find the generator matrix for C in terms of G1 and G2 .
8. A binary Hamming code CH (r), (n = 2r − 1, 2r − 1 − r, 3) is obtained by
listing all r length non-zero binary vectors as columns in the parity check
matrix. The binary Simplex code CS (r) is the dual of CH (r).
(a) Write the generator matrix G for CS (3).
(b) Find the minimum distance of this code CS (3).
(c) Find the minimum distance of the code obtained by puncturing CS (3)
in the last position.
(d) Append an all zero column to G to get a new generator matrix G0
(this code is called a Hadamard code). Show that all codewords of
G0 have equal weight (equal to half of the code length).
Hamming and Hadamard codes show 2 extremes in trade-off between rate
and distance. As the codeword length n becomes large, rate tends to 1
and minimum distance stays 3 for Hamming code whereas rate tends to 0
and minimum distance tends to n/2 for Hadamard code.

9. Let C be an [n, k, d] binary linear code and let C ∗ be the code obtained
by puncturing the i−th coordinate of (each codeword of) C. Prove:
(a) C ∗ is a linear code.
(b) If d > 1, C ∗ is an [n − 1, k, d∗ ] code where d∗ = d − 1 if C has
a minimum weight codeword with a nonzero i−th coordinate and
d∗ = d otherwise
10. Some of the following operations on the rows or columns of the generator
matrix G or the parity-check matrix H (of a binary linear code) may
increase or decrease the minimum distance of a linear block code. Indicate
for each operation whether the minimum distance might be increased or
decreased. (Reason all possibilities with an example or a proof.)
(a) Deleting a row of G.
(b) Deleting a row of H.

2
 (c) Deleting a column of H.
(d) Adding one column of H to another column of H.
11. Show that the dual of an [n, k, d] MDS code C is also an MDS code.
12. It is desired to construct a [6, 4] binary linear code having as large a
minimum distance d as possible. Which of the two bounds, the Hamming
bound or the Singleton bound, imposes the tighter restriction on d, i.e,
which of the two bounds yields a smaller upper-bound?