MathOverflow is a question and answer site for professional mathematicians. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

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)$?

share|cite|improve this question
The obvious choice works. – Felipe Voloch Dec 16 '11 at 18:33
Thank you for your helpful answer. – Zahra Taheri Dec 17 '11 at 19:20
up vote 2 down vote accepted

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

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.