2
$\begingroup$

Let $q$ be a power of prime number $p$ and let $F_{q^2}$ be a finite field of order $q^2$. Suppose that "-" be a conjugation operation that is defined as follow:

$-:F_{q^2} ‎\longrightarrow‎ ‎F_{q^2}$

$x ‎\longmapsto‎ x^q$

Let $C$ be a cyclic code of length n over $F_{q^2}$ with the generator polynomial $g(x)$ and let $\bar{C}=\lbrace \bar{c} : c \in C \rbrace$ be the conjugate code of $C$.

It is obvious that $\bar{C}$ is also a cyclic code.

Is it possible to determine the generator polynomial of $\bar{C}$ from $g(x)$?

Improve this question
$\endgroup$
1
  • 2
    $\begingroup$ The obvious choice works. $\endgroup$
    – Felipe Voloch
    Commented Dec 16, 2011 at 18:33

1 Answer 1

Reset to default
2
$\begingroup$

The generator polynomial of $\bar{C}$ is $‎\overline{g(x)}‎$. Because the conjugation operation is distributive over summation and multiplication.

Improve this answer
$\endgroup$

You must log in to answer this question.

Not the answer you're looking for? Browse other questions tagged .