A note on good permutation codes from Reed–Solomon codes

Abstract

Let M(n, d) be the maximum size of a permutation code of length n and distance d. In this note, the permutation codewords of a classical code C are considered. These are the codewords with all different entries in C. Using these codewords for Reed–Solomon codes, we present some good permutation codes in this class of codes. As a consequence, since these codes are subsets of Reed–Solomon codes, decoding algorithms known for Reed–Solomon codes can also be used as a decoding algorithm for them. © 2019, Springer Science+Business Media, LLC, part of Springer Nature.