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

Full description

Saved in:

Bibliographic Details
Published in:	Designs, codes, and cryptography Vol. 90; no. 7; pp. 1659 - 1677
Main Authors:	Bereg, Sergey, Malouf, Brian, Morales, Linda, Stanley, Thomas, Sudborough, I. Hal
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.07.2022 Springer Nature B.V
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!