.png){kind=icon}
Return
Efficient Algorithms for Permutation Arrays from Permutation Polynomials
.png){kind=icon}
PRE
AI
DOI：10.3390/e27101031.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We develop algorithms for computing permutation polynomials (PPs) using normalization, so-called F-maps and G-maps, and the Hermite criterion. This allows for a more efficient computation of PPs for larger degrees and for larger finite fields. We use this to improve some lower bounds for M(n,D), the maximum number of permutations on n symbols with a pairwise Hamming distance of D.
Keywords:
permutation Arrays
hamming distance
permutation polynomials
Journal
IF:
2
Papers:
919
Citations:
2.4W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSaveShareSave
View more