Scribd
Upload
86 views

Assignment On Algebra For Coding Theory

This document contains 20 questions about algebra and coding theory. The questions cover topics such as: constructing finite fields using irreducible polynomials; finding orders and primitive elements in finite fields; solving equations in finite fields; factoring polynomials over finite fields; and finding splitting fields of polynomials. Many questions reference previous exams to provide practice on common concepts in coding theory and algebra.

Uploaded by

farzin1haddadpour
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
86 views

Assignment On Algebra For Coding Theory

This document contains 20 questions about algebra and coding theory. The questions cover topics such as: constructing finite fields using irreducible polynomials; finding orders and primitive elements in finite fields; solving equations in finite fields; factoring polynomials over finite fields; and finding splitting fields of polynomials. Many questions reference previous exams to provide practice on common concepts in coding theory and algebra.

Uploaded by

farzin1haddadpour
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Assignment on Algebra for Coding Theory

EE512: Error Control Coding

Questions marked (Q) or (F) are questions from previous quizzes or final exams,
respectively.

1. (a) Write down the addition and multiplication tables for GF(5) and GF(7).
(b) Write down the addition and mulitplication tables for GF(4).

2. Construct GF(16) in three different ways by defining operations modulo the irreducible polynomials
x4 +x+1, x4 +x3 +1, and x4 +x3 +x2 +x+1. Find isomorphisms between the three constructions.

3. (a) Find all polynomials of degree 2 and degree 3 that are irreducible over (a) GF(2) and (b)
GF(3). Identify the irreducible polynomials that are primitive.
(b) Construct GF(9) in two different ways using a primitive and a non-primitive irreducible
polynomial. Identify a primitive element in each construction, and find an isomorphism
between the two constructions.

4. (a) Find the order of each element of GF(9) and GF(16). Identify all the primitive elements.
(b) Repeat the same for GF(32). Under what conditions do all non-zero, non-unity elements of
GF(pm ) become primitive?

5. (a) Find the order of each element of GF(7) and GF(11). Identify all the primitive elements.
(b) Can all non-zero, non-unity elements of GF(p) (p: prime) be primitive for p > 3? What about
p = 3?

6. (a) Show that all elements of GF(2m ) have square roots.


(b) Show that all elements of GF(pm ) have p-th roots.

7. Let x, y be non-zero elements of GF(16) (α is primitive satisfying α4 +α+1 = 0). Given x+y = α14
and x3 + y 3 = α, find x and y.

8. Consider GF(16) with α primitive satisfying α4 + α + 1 = 0.

(a) Find all solutions to the simultaneous equations x + y = α3 and x2 + y 2 = α6 .


(b) Find all solutions to the simultaneous equations x + y = α3 and x2 + y 2 = α.

9. Let x, y, z be distinct, nonzero elements of GF(64). Find some x, y and z such that x3 +y 3 +z 3 = 0.
Given such x, y, z, evaluate x33 + y 33 + z 33 .

10. (a) Factor x5 − 1 over (a) GF(16) and (b) GF(2) and (c) GF(11). In which cases do you get linear
factors?
(b) For what primes p does x5 − 1 factor into linear factors over GF(p)?

11. (a) Find the minimal polynomial of each element of GF(9) and GF(16).
(b) If the degree of the minimal polynomial of an element of GF(pm ) equals m, is the element
primitive?
√
12. (a) Consider the set S = {x + y 2 : x, y ∈ Z}, where Z is the set of integers. Show that S
with conventional addition and multiplication forms a commutative ring with unity. Is S an
integral domain? Is S a field?
√
(b) Consider the set S = {x + y 2 : x, y ∈ Q}, where Q is the set of rational numbers. Show
that S with conventional addition and multiplication forms a commutative ring with unity.
Is S an integral domain? Is S a field?
13. (a) Consider the ring of integers Z. Describe all elements of < 4 >, the ideal generated by 4.
Describe all elements of < 4, 6 >.
(b) Consider the ring of polynomials with real coefficients R[x]. Describe all elements of the ideals
< x2 − 1 >, < x2 − 1, x3 − 1 >, < x2 − 1, x4 − 1 >, and < x2 − 1, x3 − 1, x4 − 1 >.

14. (a) Consider the ring Z18 = {0, 1, 2, 3, · · · , 16, 17} with addition and multiplication performed
modulo 18. Show that Z18 is not an integral domain by finding zero divisors.
(b) Find the elements of Z18 that have and do not have a multiplicative inverse. Find < 2 > and
< 5 > in Z18 . For what a ∈ Z18 does < a >= Z18 ?

15. (a) In the ring Z18 , find b 6= 2 such that b × 3 = 2 × 3.


(b) Consider Z18 [x], the ring of polynomials with coefficients from Z18 . Find a, b ∈ Z18 (a 6= 1)
such that 2x(x + 1) = 2x(ax + b) in Z18 [x]. Is Z18 [x] an integral domain?

16. (a) Consider R4 = GF (2)[x]/(x4 + 1), the ring of polynomials with binary coefficients, with
operations defined modulo x4 + 1. Show that R4 is a commutative ring with unity.
(b) Find all elements of < x2 + 1 > in R4 . Find a degree-2 polynomial a(x) ∈GF(2)[x] such that
x(x2 + 1) = a(x)(x2 + 1) in R4 . Is R4 an integral domain?
(c) Find all elements of I =< x2 + 1, x3 + 1 > in R4 . Find g(x) ∈ I such that I =< g(x) >.

17. Let α ∈GF(23 ) be primitive with α3 = α + 1.

(a) Factor f (x) = x3 + α6 x2 + αx + α6 over GF(23 ).


(b) Factor f (x) = x3 + α6 x2 + α5 x + 1 over GF(23 ).

18. Perform the following factorizations:

(a) x7 + 1, x9 + 1, x11 + 1, x17 + 1, x21 + 1, x31 + 1, x51 + 1 over GF(2).


(b) x2 + 1, x4 + 1, x8 + 1, x13 + 1 over GF(3).

19. Find the splitting field (smallest field in which a polynomial factors into linear factors) for the
following polynomials:

(a) x3 + 1, x13 + 1, x23 + 1, x33 + 1 with coefficients from GF(2).


(b) x2 − 1, x11 − 1, x22 − 1, x31 − 1 with coefficients from GF(3).

20. Let α ∈ GF(26 ) be a primitive element. It is easy to see GF(2) = {0, 1} ⊆ GF(26 ). Find GF(22 )
and GF(23 ) in terms of α as subsets of GF(26 ). Interpret isomorphism as equality for this question.

You might also like