All Questions

Is it true that for any sufficiently large prime $p$, there exists a prime $q\ne p$ and a cyclic code of length $p$ over $\mathbb{F}_q$ that contains a codeword of Hamming weight at most ord$_p(q)$ ...

Let $F_q$ be the finite field with $q$ elements with characteristic $p$ and with $g$ being a primitive root. Let $N$ be a divisor of $q-1$ and let $C_0$ be the subgroup of $F_q^*$ with index $N$. Then ...