EEEE-793 - Error Detection & Error Correction

Test # 1(Solution)

Problem # 1 (30 points)

The generator matrix for a code over GF (2) is given by

=
0 1 1 1 0 0
1 1 0 0 1 0
1 0 1 0 0 1
G

(a) Find the parity-check matrix of this code.
(b) How many codewords are there of weight 0, 1, 2, 3, 4, 5, and 6?
(c) How many random errors can this code correct?
(d) Find the codeword with 101 as information symbol.
(e) Decode the received word 111001.

Solution:

(a)
| | P I G =

=
0 1 1 1 0 0
1 1 0 0 1 0
1 0 1 0 0 1
| |

= =
1 0 0 0 1 1
0 1 0 1 1 0
0 0 1 1 0 1
I P H
T


(b)


weight Number of codewords
0 1
1 0
2 0
3 4
4 3
5 0
6 0


(c)
3 =
-
d
1
2
1
=

=
-
d
t

(d) 101 = i 101011 = c
i c w(c)
000 000000 0
001 001110 3
010 010011 3
011 011101 4
100 100101 3
101 101011 4
110 110110 4
111 111000 3

(e)

111001 = r

c d(c, r)
000000 4
001110 5
010011 3
011101 2
100101 3
101011 2
110110 4
111000 1 Minimum distance

111000 = c and 111

= i


Problem # 2 (40 points)

I. The polynomial 1 ) (
2 3 4
+ + + + = x x x x x p is prime over ) 2 ( GF , therefore it can be used to
construct ) 16 ( GF .

(a) Show that the field element represented by x in this construction is not a primitive element.
(b) Show that the field element represented by 1 + x is primitive.
(c) Find the minimal polynomial of the field element represented by 1 + x .

II. Let 1 ) (
2 4
+ + + = x x x x f be a polynomial over GF(2). Express it as a product of irreducible
factors. Indicate the reasoning by which you arrived at your answer

Solution:

I.

a) Assume that x = o , then

x = o
2 2
x = o
3 3
x = o
1
2 3 4 4
+ + + = = x x x x o
1 ) 1 (
2 3 4 2 3 4 5
= + + + = + + + = = x x x x x x x x xx o

The field element x = o is not a primitive element of GF (16) since 1
5
= o .
b) Now assume that 1 + = x o , then

1 + = x o
1 ) 1 (
2 2 2
+ = + = x x o
1 ) 1 )( 1 (
2 3 2 3
+ + + = + + = x x x x x o
x x x x x + + = + = + =
2 3 4 4 4
1 ) 1 ( o
1 ) )( 1 ( ) 1 (
2 3 2 3 4 5
+ + = + + + = + = x x x x x x x o o
3 2 4 2 3 5 6
1 ) 1 )( 1 ( ) 1 ( x x x x x x x x = + + + = + + + = + = o o
1 ) 1 ( ) 1 (
2 3 4 3 6 7
+ + = + = + = + = x x x x x x x o o
1 ) 1 )( 1 ( ) 1 (
3 2 7 8
+ = + + + = + = x x x x x o o
2 3 8 9
) 1 )( 1 ( ) 1 ( x x x x = + + = + = o o
2 3 2 9 10
) 1 ( ) 1 ( x x x x x + = + = + = o o
1 ) )( 1 ( ) 1 (
3 2 3 3 4 2 3 10 11
+ + = + + + = + + = + = x x x x x x x x x x o o
x x x x x x x x = + + + = + + + = + = 1 ) 1 )( 1 ( ) 1 (
2 3 4 3 11 12
o o
x x x x x + = + = + =
2 12 13
) 1 ( ) 1 ( o o
x x x x x x + = + + = + =
3 2 13 14
) )( 1 ( ) 1 ( o o

and 1 ) )( 1 ( ) 1 (
2 3 4 3 14 15
= + + + = + + = + = x x x x x x x x o o

Therefore, the field element denoted by 1 + = x o is the primitive element of GF(16).

c) Set of conjugates:

{ }
8 4 2
o o o o = S

] ) ( ][ ) ( [ ) )( )( )( ( ) (
12 8 4 2 3 2 2 8 4 2
1
o o o o o o o o o o + + + + + + = + + + + = x x x x x x x x x f

15 10 25 2 3 20 12 3 13 7 4 12 7 2 3 13 2
1
) ( ) ( ) ( ) )( ( ) ( o o o o o o o o o o o o + + + + + + + + = + + + + = x x x x x x x x x f

1 ) (
3 4
1
+ + = x x x f

II.
) 1 )( 1 ( ) 1 ( ) 1 ( ) 1 ( ) 1 ( 1 ) (
2 3 2 2 2 2 2 4
+ + + = + + + = + + + = + + + = x x x x x x x x x x x x x f

) ( ) ( ) (
2 1
x p x p x f = where 1 ) (
1
+ = x x p and 1 ) (
2 3
2
+ + = x x x p . Both ) (
1
x p and
) (
2
x p are prime polynomials over GF (2).

Problem # 3 (30 points)

I. Certain codes of a binary (6, 3) linear block codes are

) 101001 ( c ), 010011 ( c ), 100111 (
3 2 1
= = = c


a) Find the generator matrix for this code.
b) Find the minimum distance of this code.
c) Find the syndrome and correct the error pattern in ) 101001 ( = r

II. Consider 3 linear block codes:

Code 1: a (7, 4) code with 3
min
= d
Code 2: a (15, 7) code with 5
min
= d
Code 3: a (23, 12) code with 7
min
= d

For each code compute:
a) Number of distinct syndrome.
b) Number of error patterns with weight less than or equal tot .

Solution:

I.
a)
110100 010011 100111
2 1
= + = +c c
001110 101001 100111
3 1
= + = + c c
111010 101001 010011
3 2
= + = + c c
011101 101001 010011 100111
3 2 1
= + + = + + c c c

i c
000 000000
001 001110
010 010011 Second row of G
011 011101 Third row of G
100 100111 First row of G
101 101001
110 110100
111 111010

| | P I G =

=
0 1 1 1 0 0
1 1 0 0 1 0
1 1 1 0 0 1
| |

= =
1 0 0 0 1 1
0 1 0 1 1 1
0 0 1 1 0 1
I P H
T


b) 3
min
= d

c)

Standard Array (SA)

100010 101100 110001 111111 000101 001011 010110 011000
011010 010100 001001 000111 111101 110011 101110 100000
101010 100100 111001 110111 001101 000011 011110 010000
110010 111100 100001 101111 010101 011011 000110 001000
111110 110000 101101 100011 011001 010111 001010 000100
111000 110110 101011 100101 011111 010001 001100 000010
111011 110101 101000 100110 011100 010010 001111 000001
111010 110100 101001 100111 011101 010011 001110 000000

= =
1 0 0
0 1 0
0 0 1
0 1 1
1 1 0
1 1 1
e eH S
T


S e
000 000000
001 000001
010 000010
011 010000
100 000100
101 011000
110 001000
111 100000

| | | | 0 0 0
1 0 0
0 1 0
0 0 1
0 1 1
1 1 0
1 1 1
1 0 0 1 0 1 =

= =
T
rH S

101001 ) 000000 ( ) 101001 ( = + = + = e r c

II.

Code 1: (7, 4) code with 3
min
= d

Number of distinct syndrome = 8 2 2
3
= =
k n


3
min
= d

1
2
1
min
=

=
d
t

Number of error patterns with weight less than or equal tot =
|
|
.
|

\
|
+ +
|
|
.
|

\
|
+
|
|
.
|

\
|
+
|
|
.
|

\
|
t
n n n n

2 1 0


Number of error patterns with weight less than or equal tot =
8 7 1
1
7
0
7
= + =
|
|
.
|

\
|
+
|
|
.
|

\
|


Code 2: (15, 7) code with 5
min
= d

Number of distinct syndrome = 256 2 2
7 15
= =
k n


5
min
= d

2
2
1
min
=

=
d
t

Number of error patterns with weight less than or equal tot =
|
|
.
|

\
|
+ +
|
|
.
|

\
|
+
|
|
.
|

\
|
+
|
|
.
|

\
|
t
n n n n

2 1 0


Number of error patterns with weight less than or equal tot =

121 105 15 1
2
15
1
15
0
15
= + + =
|
|
.
|

\
|
+
|
|
.
|

\
|
+
|
|
.
|

\
|


Code 3: (23, 12) code with 7
min
= d

Number of distinct syndrome = 2048 2 2
12 23
= =
k n


7
min
= d

3
2
1
min
=

=
d
t

Number of error patterns with weight less than or equal tot =
|
|
.
|

\
|
+ +
|
|
.
|

\
|
+
|
|
.
|

\
|
+
|
|
.
|

\
|
t
n n n n

2 1 0


Number of error patterns with weight less than or equal tot =

2048 1771 253 23 1
3
23
2
23
1
23
0
23
= + + + =
|
|
.
|

\
|
+
|
|
.
|

\
|
+
|
|
.
|

\
|
+
|
|
.
|

\
|