Scribd
Upload
3 views

Problem_Set_03

The document outlines Problem Set 3 for the course EE5605, focusing on error-correcting codes and their properties. Key concepts include the definition of linear codes, generator matrices, and the relationship between minimum Hamming weight and minimum distance. The problem set includes various questions related to linear codes, their rates, minimum distances, and the construction of new codes through extensions.

Uploaded by

Surajit Sahoo
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
3 views

Problem_Set_03

The document outlines Problem Set 3 for the course EE5605, focusing on error-correcting codes and their properties. Key concepts include the definition of linear codes, generator matrices, and the relationship between minimum Hamming weight and minimum distance. The problem set includes various questions related to linear codes, their rates, minimum distances, and the construction of new codes through extensions.

Uploaded by

Surajit Sahoo
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

EE5605 - Error-Correcting Codes for Communications

and Distributed Systems

Problem Set 3

Key Concepts
ˆ An [n, k] linear code C over F is defined by a generator matrix G ∈
Fk×n with rank k. The code C is the row space of G, making it a
k-dimensional subspace of Fn . The rows of G form a basis for C.

ˆ In any k-dimensional vector space, any set of k linearly independent


vectors forms a basis. Consequently, if we select any k linearly inde-
pendent codewords from C, they can be arranged as the rows of a k × n
matrix, which serves as a valid generator matrix. Since different choices
of basis yield different generator matrices, the generator matrix is not
unique. However, the code (row space) remains unchanged, though the
encoding process depends on the specific generator matrix used.

Questions
1. Let C be a linear code. We define w to be the minimum Hamming
weight of a nonzero codeword, i.e.,

w ≜ min wt(c)
c∈C
c̸=0

Let dmin (as usual) denote the minimum distance of the code. Prove
that w = dmin (proof is included in the Lec 09 notes).

2. Compute the rate and minimum distance of the linear code C = {(000), (011), (110), (101)}
over F2 . Obtain a generator matrix for the code.

3. Construct an [n = 5, k = 2] code over F2 , which can correct 1 bit er-


rors. You should specify all the codewords and also a generator matrix.
(Hint: Clearly, here we require dmin ≥ 3. Equivalently, any non-zero
codeword should have weight ≥ 3.)

1
4. Let V denote a vector space over a field F. Prove the following:

(a) c.v = 0 if and only if c = 0 or v = 0 (here, 0 and 0 are additive


identity elements of V and F, respectively).
(b) Let ᾱ denote the additive inverse of α ∈ F. Then, ᾱ.v is the
additive inverse of α.v.

5. Consider the code C over F2 with the following generator matrix. Com-
pute n, k and dmin .
 
1 0 0 1 1 0
G = 0 1 0 1 0 1
0 0 1 0 1 1

6. [Extension of a Code] Consider the code C from the previous question.


We will construct a new linear code C ′ of block length 7 by appending a
“parity-check bit” to each codeword (all operations in F2 ). Specifically,
define

C ′ = {(c1 , c2 , . . . , c6 , c7 ) | (c1 , c2 , . . . , c6 ) ∈ C, c7 = c1 + c2 + · · · + c6 } .

(a) Determine the dimension and minimum distance of C ′ .


(b) Justify why extension always results in a new code with an in-
creased minimum distance whenever the minimum distance of C
is odd (Hint: Recall that minimum distance is minimum weight).

You might also like