Solutions to problems from Chapter 2

Manjunatha. P
manjup.jnnce@gmail.com

Professor
Dept. of ECE
J.N.N. College of Engineering, Shimoga

September 5, 2014

Solutions to problems from Chapter 2

Solutions to problems from Chapter 2

2.1 Construct the group under modulo 6 addition

Manjunatha. P

(JNNCE)

Solutions to problems from Chapter 2

September 5, 2014

2/7

Solutions to problems from Chapter 2

Solutions to problems from Chapter 2

2.1 Construct the group under modulo 6 addition

Solution:
Modulo-m addition for the case m = 6 is as shown in in table:

Table: Modulo-6 addition

0
1
2
3
4
5

Manjunatha. P

(JNNCE)

0
0
1
2
3
4
4

1
1
2
3
4
5
5

2
2
3
4
5
0
0

3
3
4
5
0
1
1

4
4
5
0
1
2
2

Solutions to problems from Chapter 2

5
5
0
1
2
3
3

September 5, 2014

2/7

Solutions to problems from Chapter 2

Solutions to problems from Chapter 2

2.2 Construct the group under modulo-3 multiplication

Manjunatha. P

(JNNCE)

Solutions to problems from Chapter 2

September 5, 2014

3/7

Solutions to problems from Chapter 2

Solutions to problems from Chapter 2

2.2 Construct the group under modulo-3 multiplication

Solution:
Modulo-m multiplication for the case m = 3 is as shown in in table:

Table: Modulo-3 multiplication


1
2

Manjunatha. P

(JNNCE)

1
1
2

2
2
1

Solutions to problems from Chapter 2

September 5, 2014

3/7

Solutions to problems from Chapter 2

Solutions to problems from Chapter 2

Construct the group under modulo 7 addition multiplication tables

over GF(7)

Manjunatha. P

(JNNCE)

Solutions to problems from Chapter 2

September 5, 2014

4/7

Solutions to problems from Chapter 2

Solutions to problems from Chapter 2

Construct the group under modulo 7 addition multiplication tables

over GF(7)
Solution:
Modulo 7 addition multiplication tables over GF(7):

Table: Modulo-7 addition

0
1
2
3
4
5
6

0
0
1
2
3
4
5
6

1
1
2
3
4
5
6
0

Manjunatha. P

2
2
3
4
5
6
0
1

3
3
4
5
6
0
1
2

(JNNCE)

4
4
5
6
0
1
2
3

5
5
6
0
1
2
3
4

6
6
0
1
2
3
4
5

Table: Modulo-7 addition


0
1
2
3
4
5
6

0
0
0
0
0
0
0
0

1
0
1
2
3
4
5
6

2
0
2
4
6
1
3
5

Solutions to problems from Chapter 2

3
0
3
6
2
5
1
4

4
0
4
1
5
2
6
3

5
0
5
3
1
6
4
2

6
0
6
5
4
3
2
1

September 5, 2014

4/7

Solutions to problems from Chapter 2

Solutions to problems from Chapter 2

Construct a table for GF (23 ) based on the primitive polynomial

p(X ) = 1 + X + X 3 . Display the power, polynomial, and vector
representations of each element. Determine the order of each element.

Manjunatha. P

(JNNCE)

Solutions to problems from Chapter 2

September 5, 2014

5/7

Solutions to problems from Chapter 2

Solutions to problems from Chapter 2

Construct a table for GF (23 ) based on the primitive polynomial

p(X ) = 1 + X + X 3 . Display the power, polynomial, and vector
representations of each element. Determine the order of each element.
Solution:
p() = 1 + + 3 = 0, 3 = 1 + ,
4 = 3 = (1 + ) = + 2 ,
5 = 4 = ( + 2 ) = 2 + 3 = 2 + 1 + = 1 + + 2
6 = 5 = (1 + + 2 ) = + 2 + 3 = + 2 + 1 + = 1 + 2
Power
representation
0
1

2
3
4
5
6

Manjunatha. P

(JNNCE)

Polynomial
representation
0
1

2
1+
+ 2
1 + + 2
1 + 2

3 Tuple
representation
(000)
(100)
(010)
(001)
(110)
(011)
(111)
(101)

Solutions to problems from Chapter 2

September 5, 2014

5/7

Solutions to problems from Chapter 2

Solutions to problems from Chapter 2

An irreducible polynomial p(X) of degree m is said to be primitive if

the smallest positive integer n for which p(X) divides X n + 1 is
m
n = 2m 1 i.e X 2 1 + 1
Check that if X 3 + X + 1 is an irreducible polynomial over GF(2)?

Manjunatha. P

(JNNCE)

Solutions to problems from Chapter 2

September 5, 2014

6/7

Solutions to problems from Chapter 2

Solutions to problems from Chapter 2

An irreducible polynomial p(X) of degree m is said to be primitive if

the smallest positive integer n for which p(X) divides X n + 1 is
m
n = 2m 1 i.e X 2 1 + 1
Check that if X 3 + X + 1 is an irreducible polynomial over GF(2)?
Solution:
3 1

m=3 Therefore X 2

+ 1 = X7 + 1

x4 + x2 + x + 1
x 3 + x + 1)x 7
+1
x7 + x5 + x4
.........................................................
x5 + x4
+1
x5 + x3 + x2
.........................................................
x4 + x3 + x2 + 1
x4 + + x2 + x
.........................................................
x3 + x + 1
x3 + x + 1
.........................................................
0

Manjunatha. P

(JNNCE)

Solutions to problems from Chapter 2

September 5, 2014

6/7

Solutions to problems from Chapter 2

Solutions to problems from Chapter 2

Check that if X 4 + X + 1 is an irreducible polynomial over GF(2)?

Manjunatha. P

(JNNCE)

Solutions to problems from Chapter 2

September 5, 2014

7/7

Solutions to problems from Chapter 2

Solutions to problems from Chapter 2

Check that if X 4 + X + 1 is an irreducible polynomial over GF(2)?

Solution:
4
m=4 Therefore X 2 1 + 1 = X 15 + 1
x4 + x2 + 1 + x
x 4 + x + 1)x 15
+1
x 15 + x 12 + x 11
.........................................................
x 12 + x 11
+1
x 12 + x 9 + x 8
.........................................................
x 11 + x 9 + x 8 + 1
x 11 + + x 8 + x 7
.........................................................
x9 + x7 + 1
x9 + x6 + x5
.........................................................
x7 + x6 + x5 + 1
x7 + x4 + x3
.........................................................
x6 + x5 + x4 + x3 + 1
x6 + x3 + x2
.........................................................
x5 + x4 + x2 + 1
x5 + x2 + x
.........................................................
x4 + x + 1
x4 + x + 1
.........................................................
0
Manjunatha. P

(JNNCE)

Solutions to problems from Chapter 2

September 5, 2014

7/7