A note on good permutation codes from Reed–Solomon codes

A note on good permutation codes from Reed–Solomon codes

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 permutati...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Designs, codes, and cryptography codes, and cryptography, 2019-10, Vol.87 (10), p.2335-2340
Hauptverfasser: Sobhani, R., Abdollahi, A., Bagherian, J., Khatami, M.
Format: Artikel
Sprache:eng
Schlagworte:
Algorithms
Binary system
Circuits
Codes
Coding and Information Theory
Computer Science
Cryptology
Data Structures and Information Theory
Decoding
Discrete Mathematics in Computer Science
Information and Communication
Permutations
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:0925-1022
1573-7586
DOI:10.1007/s10623-019-00621-0