Skip to main content

Worksheet Problem Set M6

Instructions: You may type up or handwrite your work, but it must be neat, professional, and organized and it must be saved as a PDF file and uploaded to the appropriate Gradescope assignment. Use a scanner or scanning app to convert handwritten work on paper to PDF. I encourage you to type your work using the provided template.
All tasks below must have a complete solution that represents a good-faith attempt at being right to receive engagement credits. If your submission is complete and turned in on time, you will receive full engagement credits for the assignment. All other submissions will receive zero engagement credit. Read the guidelines at Grading Specifications carefully.
To abide by the class’ academic honesty policy, your work should represent your own understanding in your own words. If you work with other students, you must clearly indicate who you worked with in your submission. The same is true for using tools like generative AI although I strongly discourage you from using such tools since you need to build your own understanding here to do well on exams.

1. Minimal Polynomials.

(a)

Let \(a(x)\) be a monic irreducible polynomial over a finite field \(F\text{.}\) Show that \(a(x)\) is the minimal polynomial of the element \(\xi\) in the extension field \(F[\xi]/a(\xi).\)

(b)

Let \(\alpha\) be a nonzero element in an extension field \(E\) of \(F=\GF(q)\text{.}\) Show that the conjugacy classes of \(\alpha\) and \(\alpha^{-1}\) (with respect to \(F\)) are the same size.

(c)

Let \(M_{\alpha}(x)=\sum_{i=0}^m a_i x^i\) be the minimal polynomial of \(\alpha\) as in (b) (with respect to \(F\)). Show that the minimal polynomial of \(\alpha^{-1}\) is given by
\begin{equation*} M_{\alpha^{-1}}(x)=\frac{1}{a_0} \sum_{i=0}^m a_{m-i}x^i = \frac{1}{a_0} M_{\alpha}(x)^{[-1]}\text{.} \end{equation*}
That is, up to scaling by some nonzero element of \(F\text{,}\) the minimal polynomial of \(\alpha^{-1}\) is the reciprocal polynomial obtained by reversing the order of coefficients of the minimal polynomial of \(\alpha\text{.}\)

2. All Finite Field Automorphisms are Frobenius.

Let \(p\) be a prime and let \(E\) and \(K\) be extension fields of \(F=\GF(p)\) with the same extension degree \(n\text{.}\)

(a)

Let \(\varphi: K \to E\) be an isomorphism (a multiplicative, additive, bijective map). Show that the minimal polynomial (with respect to \(F\)) of every element \(\beta \in K\) is the same as the minimal polynomial of the element \(\varphi(\beta)\in E\text{.}\)

(b)

Show that every isomorphism \(\varphi: K \to E\) is completely defined by the value of \(\varphi\) at an element \(\beta\in K\) that does not belong to any proper subfield of \(K\text{.}\)

(c)

Show that there are exactly \(n\) distinct isomorphisms \(\varphi:K \to E\text{.}\)
Hint.
Given an element \(\beta \in K\) that does not belong to any proper subfield of \(K\text{,}\) what are the possible values that \(\varphi(\beta)\) may take?

(d)

Show that the automorphisms \(\varphi: K \to K\) are the Frobenius mappings \(f_m: x \mapsto x^{p^m}\text{.}\)

3. Burst Error Correction and Cyclic Codes.

Let \(C\) be a binary \([15,9]\) cyclic code generated by \(g(x)=1+x^3+x^4+x^5+x^6\text{.}\) Suppose that we know \(C\) can correct any burst of length 3 or less. Decode each of the following vectors.

4. BCH Codes Again.

Let \(\alpha\) be a primitive element in \(E=\GF(2^m)\) and let \(C_{\BCH}\) be a narrow-sense primitive BCH code (of length \(n=2^m-1\)) over \(F=\GF(2)\) whose parity-check matrix is obtained by representing each entry in
\begin{equation*} \begin{bmatrix} 1 \amp \alpha \amp \alpha^2 \amp \dots \amp \alpha^{n-1} \\ 1 \amp \alpha^3 \amp \alpha^6 \amp \dots \amp \alpha^{3(n-1)} \end{bmatrix} \end{equation*}
as a column vector in \(F^m \text{.}\) For the given code \(C_{\BCH}\text{,}\) let \(C_{\RS}\) be an \([N=n,K,D]\) code over \(E\) that satisfies
\begin{equation*} C_{\BCH}=C_{\RS} \cap F^N \end{equation*}

(a)

Show that \(\alpha^2,\alpha^4,\) and \(\alpha^6\) are roots of \(C_{\BCH}\text{.}\)

(b)

Write a parity-check matrix of \(C_{\RS}\text{,}\) assuming that \(D=5\) and that \(\alpha^3\) is a root of \(C_{\RS}\text{.}\)

(c)

Repeat part (b), except that now \(D=4\) (and \(\alpha^3\) is still a root of \(C_{\RS}\)). IS the solution unique?

(d)

Find the largest possible dimension of any RS code \(C_{\RS}\) over \(E\) that satisfies \(C_{\BCH}=C_{\RS}\cap \F^N\text{.}\)