 Ternary Hamming code as a negacyclic code

Set $n=(3^s-1)/2$ and let $\beta$ be a primitive element of a finite field ${\mathbb{F}}_{3^s}$. The powers $1,\beta ,\dots ,{\beta }^{n-1}$ represent every projective point once. Their kernel code is a ternary Hamming code. Since ${\beta }^n=-1$, its polynomial description is a negacyclic code, generated by the minimal polynomial of an algebraic element $\beta$ over ${\mathbb{F}}_3$.