Scribd
Upload
8 views2 pages

Serie 004

The document contains exercises related to linear codes in information theory and coding, focusing on generator matrices, parity-check matrices, minimum distances, and error detection and correction capabilities. It includes specific tasks for various linear codes, such as determining parameters, generating codewords, and decoding received words. The exercises are structured to enhance understanding of fundamental concepts in coding theory.

Uploaded by

benmokhtarhatem.usthbenglish
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
8 views2 pages

Serie 004

The document contains exercises related to linear codes in information theory and coding, focusing on generator matrices, parity-check matrices, minimum distances, and error detection and correction capabilities. It includes specific tasks for various linear codes, such as determining parameters, generating codewords, and decoding received words. The exercises are structured to enhance understanding of fundamental concepts in coding theory.

Uploaded by

benmokhtarhatem.usthbenglish
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 Science and Technology Houari Boumediene " U.S.T.H.

B"
Faculty of Electrical Engineering (FGE)
Department of Telecommunications

Module: Fundamentals of Information Theory and Coding

Series No 4
"All operations are in modulo 2"

Exercise 1

Let us consider a linear code C (9, 3) with the following generator matrix:

100100100

𝐺= 010010010

001001001

1. Determine the values of n and k and explain what they represent. What is the code rate
of this code?"

2. Give the parity-check matrix H of the code.

3. Determine the minimum distance between the codewords.

4. How many errors can this code detect and correct ?

Exercise 2

We consider a linear code C (6, 3) in which the three parity check bits of a codeword C₄, C₅, C₆
are calculated as follows:

 C₄ = d₁ ⊕ d₃

 C₅ = d₁ ⊕ d₂ ⊕ d₃

 C₆ = d₁ ⊕ d₂

1. Write the generator matrix of this code.

2. Write all the possible codewords generated by this code.

3. Suppose the received word is 010111. Decode this word by identifying and correcting
any erroneous bits.

1/2
Exercise 3

Let C(7,4) be a linear code that associates to the information vector


i=(i1,i2,i3,i4) the codeword c=(i1,i2,i3,i4,c5,c6,c7)

With: c5=i1⊕i3⊕i4 c6=i1⊕i2⊕i3 c7=i2⊕i3⊕i4


1. Give the generator matrix and the parity-check matrix of this code.
2. Given i= (1 0 1 0), what is the associated codeword?
3. Given the message m= (1 1 1 1 0 0 1), is it a valid codeword?

Exercise 4
Let C (n, k) be a linear code with the following parity-check matrix:

1001110

𝐻= 0101101

0011011

1. Determine the values of n and k ?


2. What is the minimum distance between the codewords?
3. If the received codeword is (0000011), find the correct message word.

Exercise 5

Consider a linear block code (6, 3) with the following generator matrix G:

111010

G= 011101

101001

1. A code in systematic form is such that the codewords consist of the k information bits
followed by (n−k) redundancy bits. Write the generator matrix in systematic form.
2. List all the codewords of the code.
3. Deduce the minimum distance dmin of the code. How many errors can it correct?
4. Determine the parity-check matrix H of the code, based on the systematic form of
the generator matrix.

2/2

You might also like