Scribd
Upload
177 views2 pages

Coding Theory - Exam

This document contains an exam on coding theory consisting of 4 problems. Problem 1 involves (a) finding the codewords, minimum distance, and parity check matrix of a binary linear code, (b) stating the ball packing bound for q-ary codes, and (c) determining if perfect codes exist for given parameters. Problem 2 involves (a) defining Reed-Muller codes and (b) constructing a generator matrix and decoding a codeword of an R(1,3) code. Problem 3 involves (a) defining BCH codes and stating the BCH bound, and (b-c) questions related to a specific binary BCH code. Problem 4 involves decoding a received vector for a BCH code with

Uploaded by

Marija Marija
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
177 views2 pages

Coding Theory - Exam

This document contains an exam on coding theory consisting of 4 problems. Problem 1 involves (a) finding the codewords, minimum distance, and parity check matrix of a binary linear code, (b) stating the ball packing bound for q-ary codes, and (c) determining if perfect codes exist for given parameters. Problem 2 involves (a) defining Reed-Muller codes and (b) constructing a generator matrix and decoding a codeword of an R(1,3) code. Problem 3 involves (a) defining BCH codes and stating the BCH bound, and (b-c) questions related to a specific binary BCH code. Problem 4 involves decoding a received vector for a BCH code with

Uploaded by

Marija Marija
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

UNIVERSITY OF PRIMORSKA

FAMNIT

Exam
Coding Theory

8.7.2021.

1. (a) Find all codewords, the minimum distance and a parity-check ma-
trix for the binary linear code of type (5, 3) defined by the gener-
ator matrix  
0 1 0 0 1
G =  0 0 1 0 1 .
1 0 0 1 1
(b) State the ball packing bound for any q-ary [n, M, d]-code.
(c) For each of the following triples determine whether a perfect bi-
nary [n, M, d]-code exists:

(24, 212 , 8), (63, 257 , 3).

2. (a) Write down the definition of the Reed-Muller R(1, r) code.


(b) Construct a generator matrix of the Reed-Muller R(1, 3) code and
decode the received codeword r = 01010111.

Hint: The decoding procedure uses the following steps:

(a) Construct the vector R = (−1)r .


(b) Construct the Sylvester-Hadamard matrix of the size 8 × 8.
(c) Compute R̂ = RH.
(d) Find the maximum absolute value in R̂.
(e) The binary representation of the entry in R̂ specifies the lin-
ear combination of the basis vectors of G to be used (apart from
all-one vector).

3. (a) Define a BCH code over GF (q) of block length n and designed
distance δ. Then, write down the BCH bound.
(b) A binary BCH code C of length 15 has α3 , α4 , α5 among its roots,
where α belongs to a suitable finite field extension GF (q). De-
termine the dimension of C and a lower bound for its minimum
distance.
(c) Let C1 and C2 be cyclic codes of block length n generated by g1 (x)
and g2 (x), respectively. The intersection of cyclic codes is cyclic.
Find the generator polynomial of C1 ∩ C2 .

4. Consider the BCH code C with the block length n = 31 and generator
polynomial g(x) = 1 + x3 + x5 + x6 + x8 + x9 + x10 having the roots
αi for i = 1, 2, 3, 4. Here α is a root of the irreducible polynomial
x5 + x2 + 1 which generates GF (25 ). Suppose the received vector r is
given as r(x) = x2 + x7 + x8 + x11 + x12 , where exactly 2 errors have
occurred.
S +S 3
(a) Using the fact that S1 = r(α) = α7 and 3S1 1 = α15 , where S1 =
r(α) and S3 = r(α3 ), write down the error locator polynomial
Λ(x). What is the interpretation of the roots of Λ(x)?
(b) Write down the error polynomial e(x) and decode r(x).
(c) Under which conditions (given in terms of Si = r(αi )) a single
error occurs only?

You might also like