Using permutation rational functions to obtain permutation arrays with large hamming distance

We consider permutation rational functions ( PRFs ), V ( x )/ U ( x ), where both V ( x ) and U ( x ) are polynomials over a finite field F q . Permutation rational functions have been the subject of several recent papers. Let M ( n ,  D ) denote the maximum number of permutations on n symbols with...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Designs, codes, and cryptography codes, and cryptography, 2022-07, Vol.90 (7), p.1659-1677
Hauptverfasser:	Bereg, Sergey, Malouf, Brian, Morales, Linda, Stanley, Thomas, Sudborough, I. Hal
Format:	Artikel
Sprache:	eng
Schlagworte:	Coding and Information Theory Computer Science Cryptology Discrete Mathematics in Computer Science Error correcting codes Error correction Fields (mathematics) Lower bounds Permutations Polynomials Rational functions
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!