| Summary: | In this research paper, the repeated-root constacyclic codes over the chain ring F<sub>p</sub>m + uF<sub>p</sub>m are considered, where p is a prime and m > 0 is any integer. The b-symbol distance for prime power length, i.e. p<sup>s</sup> is also studied for any integer s > 0. The Hamming and symbol-pair distances of all δ-constacyclic codes have been thoroughly studied in [18], where δ is an unit in the ring F<sub>p</sub>m + uF<sub>p</sub>m which is of the form ζ and φ + uφ, where 0 ≠ 6 φ, φ, ζ ∈ F<sub>p</sub>m. In this paper, the b-symbol distance of all such δ-constacyclic codes of prime power length is computed for 1 ≤ b ≤ ⌊p/2⌋. Furthermore, as an application, all MDS b-symbol constacyclic codes of length p<sup>s</sup> over F<sub>p</sub>m + uF<sub>p</sub>m are established.
|
|---|