On the hamming distances of constacyclic codes of length 5p^S

Abstract

© 2013 IEEE. Let p be a prime, s, m be positive integers, and λ be a nonzero element of the finite field Fpm. In this paper, the algebraic structures of constacyclic codes of length 5~ps~(p≠5) are obtained, which provide all self-dual, self-orthogonal and dual containing codes. Moreover, the exact values of the Hamming distances of all such codes are completely determined. Among other results, we obtain the degrees of the generator polynomials of all MDS repeated-root constacyclic codes of arbitrary length. As applications, several new and optimal codes are provided.