Results 251 to 260 of about 103,432 (283)
Some of the next articles are maybe not open access.
Permutation polynomials and factorization
Cryptography and Communications, 2020zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kalaycı, Tekgül +2 more
openaire +3 more sources
Testing permutation polynomials
30th Annual Symposium on Foundations of Computer Science, 1989The simple test for determining whether an arbitrary polynomial is a permutation polynomial, by producing its list of values, is considered, and it is found that off-the-shelf techniques from computer algebra improve the running time slightly, without requiring any new insights into the problem.
openaire +1 more source
Permutation polynomials and primitive permutation groups
Archiv der Mathematik, 1991In 1966 L. Carlitz conjectured that for every even positive integer \(n\) there exists a constant \(c_ n\) such that for any odd \(q>c_ n\) there is no permutation polynomial of degree \(n\) over the finite field \(F_ q\) of order \(q\). This conjecture was known to hold for \(n\) a power of 2 and for all even \(n\leq 16\). In this paper the conjecture
openaire +1 more source
Linear Permutation Polynomial Codes
2019 IEEE International Symposium on Information Theory (ISIT), 2019Quasi-cyclic low-density parity-check (QC-LDPC) codes are one of the most important code classes of LDPC codes. They have two drawbacks: lack of randomness and limited girth lead to a degraded decoding performance in the waterfall and error floor regions, respectively.
Ryoichiro Yoshida, Kenta Kasai
openaire +1 more source
Witt Rings and Permutation Polynomials
Algebra Colloquium, 2005Let p be a prime number. In this paper, the author sets up a canonical correspondence between polynomial functions over ℤ/p2ℤ and 3-tuples of polynomial functions over ℤ/pℤ. Based on this correspondence, he proves and reproves some fundamental results on permutation polynomials mod pl.
openaire +1 more source
ON SOME CLASSES OF PERMUTATION POLYNOMIALS
International Journal of Number Theory, 2008Let p be a prime and q = pm. We investigate permutation properties of polynomials P(x) = xr + xr+s + ⋯ + xr+ks (0 < r < q - 1, 0 < s < q - 1, and k ≥ 0) over a finite field 𝔽q. More specifically, we construct several classes of permutation polynomials of this form over 𝔽q. We also count the number of permutation polynomials in each class.
Akbary, Amir, Alaric, Sean, Wang, Qiang
openaire +2 more sources
Tests for Permutation Polynomials
SIAM Journal on Computing, 1991If $\mathbb{F}_q $ is a finite field and $f \in \mathbb{F}_q [x]$, then f is called a permutation polynomial if the mapping $\mathbb{F}_q \to \mathbb{F}_q $ induced by f is bijective. This property can be tested by a probabilistic algorithm whose number of operations is polynomial (in fact, essentially linear) in the input size, i.e., in $\deg f \cdot \
openaire +1 more source
Uniformly Representable Permutation Polynomials
2002We outline the basics for a systematic study of permutation polynomials on finite fields with characteristic 2, which admit a certain uniform representation. We describe a general technique to confirm the permutation property of such polynomials by algebraic calculations with multivariate polynomials over the two-element field.
openaire +1 more source
Permutations amongst the Dembowski-Ostrom Polynomials
2001We note that certain Dembowski-Ostrom polynomials can be obtained from the product of two linearised polynomials. We examine this subclass for permutation behaviour over finite fields. In particular, a new infinite class of permutation polynomials is identified.
Blokhuis, A. +3 more
openaire +2 more sources
A Polynomial Membership Function Approach for Stability Analysis of Fuzzy Systems
IEEE Transactions on Fuzzy Systems, 2021Wen-Bo Xie, Hak-Keung Lam, Jian Zhang
exaly