ON SYMBOL-PAIR DISTANCE DISTRIBUTIONS OF REPEATED-ROOT CONSTACYCLIC CODES OF LENGTH 4ps AND MDS CODES

. Let m be a positive integer such that the scenario pm equivalent to 1 (mod 4) holds and also let p be an odd prime. The error-correcting capacity of a symbolpair code can be estimated using the symbol-pair distance. In this paper, the symbol-pair distances are completely determined for lambda-constacyclic codes of length 4ps over Fpm , where lambda is an element of F & lowast;pm , based on the generators given by Cases 1, 2, and 3 in Table 1. The best error-correcting capacity is found in maximum distance separable (MDS) symbol-pair codes. We explore two new classes of non-trivial MDS symbol-pair codes of length 4ps over the finite field for the codes of Case 3 of Table 1 by using the symbol-pair Singleton bound. We exhibit several new MDS symbol-pair codes of length 4ps over the finite field in Table 2 as examples.