The Symbol-pair Distance Of Constacyclic Codes Over Finite Ring

Symbol-pair codes are a new kind of error-correcting codes with the development of information technology,which can effectively protect information over symbol-pair read channels.Since the symbol-pair codes are proposed,the code construction,decoding and lower and upper bounds on code sizes have been studied by many experts and scholars.For any symbol-pair code,the symbol-pair distance is an important parameter for measuring its pair-error-correcting capability.Generally,the bigger the pair-distance of a code becomes,the stronger the pair-error-correcting capability becomes.Thus,it is very significant for a code to determine its symbol-pair distance.In this paper,the symbol-pair distance of negacyclic codes overGR?2^a,m?of length 2^sand constacyclic codes overZ₄ of length 2^sis studied.By using the structure and Hamming distance of these classes of codes,their symbol-pair distance is completely determined,and their symbol-pair distance distribution is given.Finally,a family of maximum distance separable?MDS?symbol-pair codes is constructed from cyclic codes of length 2^soverZ₄.