Some MDS Symbol Pair Cyclic Codes over Finite Fields with Applications to Symbol-Pair Read Channels

Symbol-Pair (SP) codes have attracted considerable interest in modern datastorage systems because of their ability to efficiently handle errors which occuras overlapping pairs in SP read channel. Maximum distance separable(MDS)SP codes are such code that satisfy the singleton-type bound and is optimalregarding pair-error correcting efficiency. This paper, deals with new formation ofMDS SP codes based on simple-root codes with lengths n = 4s + 4, dr = 7 fors ≡ 1(mod4), n = 4s − 4, dr = 8 for s ≡ 3(mod4) and n = 2s + 2, dr = 9for odd prime power s. Notably, for pair distances dr = 7, 8, proposed s−aryMDS SP codes, when s is prime power. Moreover, for dr = 9 the constructedcodes yields the optimal lengths independently for primality of s.