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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
