EC3021D Information Theory and Coding
Problem Sheet-5
Dr. Nujoom Sageer Karat
26-01-2025
Based on Lec-8, Lec-9 and Lec-10
1. (Topic: Linear codes) Show that C = {0000, 1100, 0011, 1111} is a linear code.
(a) Find the length, dimension, and minimum distance of the code C.
(b) Give a generator matrix for C.
2. (Topic: Systematic Generator and Parity Check matrices) A generator matrix G for a
code is given as:
1 1 0 0 0 0
G = 0 0 1 1 0 0 .
0 0 0 0 1 1
This code is non-systematic as the first three columns of G are not linearly independent.
(a) Do column permutations to obtain another code that has the same parameters
and a systematic generator matrix G′ .
(b) Obtain parity check matrix corresponding to the new code.
(c) Comment on the minimum distance.
3. (Topic: Generator matrix) A generator matrix G for a code is given as:
1 1 0 0 0 0
G = 0 0 1 1 0 0 .
0 0 0 0 1 1
(a) Give the length and dimension of the code.
(b) Encode the message 011.
(c) Give another generator matrix for the same code. Find the codeword correspond-
ing to 011 using this generator matrix.
1
(d) Can a systematic generator matrix be given for this code? If yes, give a systematic
generator matrix. If no, suggest a new code with the same length and dimension
for which a systematic generator matrix can be constructed.
4. (Topic: Dual Code) Consider the [n, 1, n] repetition code C.
(a) Give a generator matrix for this code.
(b) Describe the dual code (C ⊥ ) of this code. What will be the dimension of the dual
code C ⊥ ?
5. (Topic: Ternary code) Let C be a linear code over F3 = {0, 1, 2} that is generated by
2 1 2 1
G= .
1 1 1 0
(a) List all the codewords of C. What is the dimension of C?
(b) Find a systematic generator matrix of C.
(c) Compute the minimum distance of C.
6. (Topic: Parity check equations) Consider a systematic 8-length code over F2 whose
parity check equations are:
p1 = m2 + m3 + m4 ,
p2 = m1 + m2 + m3 ,
p3 = m1 + m2 + m4 ,
p4 = m1 + m3 + m4 ,
where m1 , m2 , m3 , and m4 are message digits and p1 , p2 , p3 , p4 are parity-check digits.
(a) Find the dimension of the code.
(b) Give a parity check matrix and a generator matrix for the code.
(c) Show analytically that the minimum distance of this code is 4.
(d) Show that this code is a self-dual code.
7. (Topic: Self-dual codes)
(a) Show that a bianry linear code with check matrix H = [P I] is a self-dual code if
and only if P is a square matrix satisfying P P T = I.
(b) Construct a self-dual code of length 4.
8. (Topic: Extension of a code) Show that if a linear binary code has a minimum distance
that is odd, extending the code by appending an overall check symbol increases the
minimum distance by one.
2
9. (Topic: MDS codes and perfect codes) Identify MDS codes and perfect codes from the
following:
(a) [3, 2, 1]- code
(b) [5, 1, 5- code
(c) [7, 4, 4]-code
(d) [7, 6, 2]- code
10. (Topic: Hamming Codes) Which of the following is not a valid Hamming code:
(a) [255,247, 3] (b) [2047, 2035, 3] (c) [4095, 4083, 3]
11. (Topic: Error detection and error correction capabilities) Consider a parity check ma-
trix for a code given as
1 0 1 0
H= .
1 1 0 1
(a) Find the corresponding generator matrix G.
(b) List all the codewords of this code.
(c) Find the minimum distance, error-correction capability, and error-detection ca-
pability of the code.
12. (Topic: Combination of codes) Let G1 and G2 be generator matrices of [n1 , k1 , d1 ] and
[n2 , k2 , d2 ] codes, respectively. Find length, dimension and minimum distance of code
with generator matrix
(a)
G = G1 | G2 .
(b)
G1 0
G= .
0 G2
