Results 21 to 30 of about 103,432 (283)
Permutation and complete permutation polynomials
Finite Fields and Their Applications, 2015 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bassalygo, L. A., Zinoviev, V. A.
openaire +1 more source
Twisted Alexander polynomials detect the unknot [PDF]
, 2006 The group of a nontrivial knot admits a finite permutation representation such that the corresponding twisted Alexander polynomial is not a unit.Comment: This is the version published by Algebraic & Geometric Topology on 14 November ...
Crowell +6 more
core +3 more sources
Am-permutation polynomials [PDF]
Journal of the Australian Mathematical Society, 2006 AbstractWe introduce a class of polynomials which induce a permutation on the set of polynomials in one variable of degree less than m over a finite field. We call then Am-permutation polynomials. We also give three criteria to characterize such polynomials.
openaire +2 more sources
A Coefficient Test for Quintic Permutation Polynomials Over Integer Rings
IEEE Access, 2018 For selecting appropriate permutation polynomials (PPs) in practical applications, it is necessary to know the coefficients of the polynomial since a brute-force exhaustive search is impractical when the number of PPs is large.
Lucian Trifina, Daniela Tarniceriu
doaj +1 more source
Fixed Points of the Dickson Polynomials of the Second Kind
Journal of Applied Mathematics, 2013 The permutation behavior of Dickson polynomials of the first kind has been extensively studied, while such behavior for Dickson polynomials of the second kind is less known.
Adama Diene, Mohamed A. Salim
doaj +1 more source
Constructions of Polynomial Codes Based on Circular Permutation Over Finite Fields
IEEE Access, 2020 As a kind of very important error-correcting codes, polynomial codes have the advantages of good performance and simple structure. Generalized R-S codes over $F_{q}$ as polynomial codes have the advantages described above, but their lengths $n$ are ...
Xiuli Wang, Yakun Hao, Dan Qiao
doaj +1 more source
Enumerating permutation polynomials
Finite Fields and Their Applications, 2017 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Theodoulos Garefalakis +1 more
openaire +1 more source
Symplectic Spreads and Permutation Polynomials [PDF]
, 2004 Every symplectic spread of PG(3,q), or equivalently every ovoid of Q(4,q), is shown to give rise to a certain family of permutation polynomials of GF(q) and conversely. This leads to an algebraic proof of the existence of the Tits-Luneburg spread of W(2^{2h+1}) and the Ree-Tits spread of W(3^{2h+1}), as well as to a new family of low-degree permutation
Ball, Simeon Michael, Zieve, Michael
openaire +3 more sources
A New Attack on NTRU Public Key Cryptosystem Depend on Using Public Key and Public Information [PDF]
Engineering and Technology Journal, 2010 This paper proposed a new method to attack the NTRU cryptosystem [Hof00a,Hof98b]. It tried to exploit the public information about the parameters of NTRUcryptosystem and using the public key, to recover the private keys without delvingin the detail of ...
Abdul Monem S.Rahma +1 more
doaj +1 more source
Analysis of cubic permutation polynomials for turbo codes
, 2012 Quadratic permutation polynomials (QPPs) have been widely studied and used as interleavers in turbo codes. However, less attention has been given to cubic permutation polynomials (CPPs).
D. Tărniceriu +14 more
core +1 more source