Scribd
Upload
43 views

Coding Theory - Test 1

1. The document contains a test on coding theory with 4 questions. Question 1 deals with a binary linear code with generator matrix G and tasks related to decoding and error probability. 2. Question 2 asks about constructing specific binary codes based on parameters, states the sphere packing bound, and asks about a perfect code. 3. Question 3 covers properties of perfect codes, even weights in codes, and proves the Singleton bound theorem. 4. Question 4 involves a binary cyclic code generated by a polynomial g(x), generating matrices, encoding a message, and properties of cyclic codes.

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
43 views

Coding Theory - Test 1

1. The document contains a test on coding theory with 4 questions. Question 1 deals with a binary linear code with generator matrix G and tasks related to decoding and error probability. 2. Question 2 asks about constructing specific binary codes based on parameters, states the sphere packing bound, and asks about a perfect code. 3. Question 3 covers properties of perfect codes, even weights in codes, and proves the Singleton bound theorem. 4. Question 4 involves a binary cyclic code generated by a polynomial g(x), generating matrices, encoding a message, and properties of cyclic codes.

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

Test 1
Coding Theory

15.04.2021.

1. Let C be a linear binary code with the generator matrix G given as


 
1 0 1 0
G= .
0 1 0 1

(a) Construct the standard array for the code C.


(b) Decode the received vectors (1101) and (0011) using the standard
array decoding method.
(c) Give an example of two errors occurring and not being corrected.
(d) Assume code C is transmitted through a binary symmetric chan-
nel with symbol error probability p = 0.01, where the word error
probability is independent of the codeword transmitted. Compute
Perr (C).

2. (a) If possible, construct a binary [n, M, d]-code with each of the fol-
lowing parameters:

[9, 2, 9], [3, 8, 1], [8, 41, 3].

In each case if no such code exists, prove it.


(b) State the Sphere packing bound for any q-ary [n, M, d] block code.
Then, check whether [24, 212 , 8] code is perfect.
(c) Given is a generator matrix of a (4, 2) linear code C with d = 2 as
 
1 0 1 1
G= .
1 1 0 1

Find the weight distribution of the dual code C ⊥ .


3. (a) Show that the minimum distance of a perfect code must be odd.
(b) Show that if there is a binary [n, M, d] code with d even then there
is an [n, M, d] code in which all codewords have even weight.
(c) Prove the Singleton bound theorem: If C is a (n, k, d)-linear code,
then d ≤ n − k + 1.

4. (a) Let C be (7, 4)-binary cyclic code generated by g(x) = 1 + x + x3 .


i) Prove that g(x) divides f (x) = x7 − 1.
ii) Write the generating matrix of C, and encode the message
m = (1011).
(b) Prove the following statement (where F denotes a field): Let h(x)
be a monic divisor of f (x) = xn − 1. Then h(x) is the gen-
erator polynomial of the ideal I = {a(x)h(x) : a(x) ∈ R} of
R = F [x]/(xn − 1).
(c) Let C 0 be a cyclic binary code of odd length (i.e. length of all
codewords is odd). Show that C 0 contains a codeword of odd
weight if and only if it contains the all 1s word (111 . . . 1).

You might also like