Scribd
Upload
7 views

Assignment 2

Uploaded by

bestbeingsandeep5445
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
7 views

Assignment 2

Uploaded by

bestbeingsandeep5445
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Assignment 2

Coding Theory (MA-520 and MAN-625)


(Autumn Semester 2024-25)

(1) Let Gi and Hi be the generator matrix and the parity-check matrix, respectively, of the [n, ki ]
code Ci , i = 1, 2.
(a) Find a parity-check matrix for the code C1 ⊕ C2 .
(b) Find a generator matrix and a parity-check matrix for the code {(u | u+v) | u ∈ C1 , v ∈ C2 },
and justify your answer.
(2) Let R(r, m) denote the binary Reed-Muller code of length 2m and order r. For 0 ≤ r < m, show
that R(r, m)⊥ = R(m − 1 − r, m).
(3) Using Hamming bound, find an upper bound on k for which there exists a [15, k, 5] binary code.
(4) Prove that Aq (n, d) ≤ qAq (n − 1, d).
(5) Show that there does not exist a [12, 7, 5] code.
(6) Show that there is no binary code with parameters [2m , 2m − m, 3] for any m ≥ 2.
(7) Let C be a binary linear code with parameters [2m , k, 4] for some m ≥ 2. Show that k ≤ 2m −m−1.
(8) Prove that there is no perfect 2-error correcting binary code of length n for 6 ≤ n ≤ 10.
(9) Show that the minimum distance of a perfect code must be odd.
(10) Determine the number of subfields of F256 and F729 .
(11) Prove that f (x) = x4 + x + 1 ∈ F2 [x] is a primitive polynomial. Compute

(α10 + α5 )(α4 + α2 )
,
1 + α5 + α7

where α is a root of f (x).


(12) If xn − 1 factor in Fq , q = pm , and (n, p) = 1, show that xn − 1 has distinct factors.
(13) Show that the Hamming code Hq (r), with q = 4 and r = 2, is an MDS code.
(14) Show that the only binary MDS codes are the whole space, the set of all even weight vectors, and
the repetition codes.
(15) Let C be an [n, k, d] code over Fq . Show that the number of codewords of minimum weight d is
divisible by q − 1 and is at most equal to (q − 1) nd . Show that C is MDS in case equality holds.


(16) Let q ≥ 2 and n ≥ 2 be any integers. Show that Aq (n, 2) = q n−1 .


(17) Consider the finite fields Fqm and Fq and define the mapping Tr : Fqm → Fq by

2 m−1
T r(x) = x + xq + xq + · · · + xq .

Then show that


(a) T r(x) ∈ Fq (b) T r(x + y) = T r(x) + T r(y) (c) T r(ax) = aT r(x) for a ∈ Fq
(d) T r(x) takes each value of Fq equally often.
(18) (i) Show that the polynomial x5 + x2 + 1 is irreducible in over F2 .

1
2

(ii) Let α be an element of F32 that satisfies α5 + α2 + 1 = 0.


Calculate f (x) = (x − α)(x − α2 )(x − α4 )(x − α8 )(x − α16 ).
If α4 + α3 + α = αi , then what is i?
(19) Let r and s be positive integer. Show that over every field, the polynomial xr − 1 divides xs − 1
if and only if r | s.
(20) Let C be an (n, M, d) code over Fq . Then the covering radius r of C is the largest distance of C
from of any word in Fnq . Then show that
(i) M Vq (n, r) ≥ q n ,
(ii) r ≥ (d − 1)/2 and that equality holds if and only if C is perfect,
(iii) if C is a linear [n, k] code then r ≤ n − k.

You might also like