Two generalizations on the minimum Hamming distance of repeated-root constacyclic codes

Hakan Ozadam, Ferruh Ozbudak

We study constacyclic codes, of length $n{p}^s$ and $2n{p}^s$, that are generated by the polynomials $(x^n+\gamma {)}^{\ell }$ and $(x^n-\xi {)}^i(x^n+\xi {)}^j$\ respectively, where $x^n+\gamma$, $x^…