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

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Designs, codes, and cryptography Ročník 90; číslo 7; s. 1659 - 1677
Hlavní autori:	Bereg, Sergey, Malouf, Brian, Morales, Linda, Stanley, Thomas, Sudborough, I. Hal
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.07.2022 Springer Nature B.V
Predmet:	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 Hamming distance Permutation rational functions Permutation codes Permutation polynomials 94B60 Permutation arrays 05A05 94B65
ISSN:	0925-1022, 1573-7586
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!