New constructions of optimal symbol-pair constacyclic codes of length \(4p^s\)
摘要
Symbol-pair codes address error patterns in communication channels where adjacent symbols are more likely to be corrupted together. Among these, maximum distance separable (MDS) and almost maximum distance separable (AMDS) symbol-pair codes are of particular interest due to their optimal error-correcting capabilities. This paper gives two new constructions of MDS and AMDS symbol-pair constacyclic codes based on repeated-root cyclic codes.