On the public citation graph
Permutation polynomials over finite fields
0 signed · 82 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-3-662-07998-0openalex-snapshot
Introduction to coding theory
inferredcites →https://doi.org/10.1007/bfb0080437openalex-snapshot
Equations over Finite Fields An Elementary Approach
inferredcites →https://doi.org/10.1017/s1446788700018346openalex-snapshot
Complete mappings of finite fields
inferredcites →https://doi.org/10.1090/s0002-9904-1962-10750-2openalex-snapshot
Some theorems on permutation polynomials
inferredcites →https://doi.org/10.1215/s0012-7094-67-03433-3openalex-snapshot
A geometric approach to permutation polynomials over a finite field
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/ffta.1998.0223openalex-snapshot
On Value Sets of Polynomials over a Finite Field
inferred← citeshttps://doi.org/10.1007/978-0-387-68361-4_25openalex-snapshot
Classes of Permutation Polynomials Based on Cyclotomy and an Additive Analogue
inferred← citeshttps://doi.org/10.1007/978-3-540-77404-4_11openalex-snapshot
Cyclotomic Mapping Permutation Polynomials over Finite Fields
inferred← citeshttps://doi.org/10.1007/978-3-642-12200-2_35openalex-snapshot
Ambiguity and Deficiency in Costas Arrays and APN Permutations
inferred← citeshttps://doi.org/10.1007/bf01277957openalex-snapshot
The computational complexity of recognizing permutation functions
inferred← citeshttps://doi.org/10.1007/bf02760932openalex-snapshot
Bounds for fixed point free elements in a transitive group and applications to curves over finite fields
inferred← citeshttps://doi.org/10.1007/bf02808112openalex-snapshot
Schur covers and Carlitz’s conjecture
inferred← citeshttps://doi.org/10.1007/bf02883675openalex-snapshot
Algorithmic criteria for permutation orthogonal systems over finite fields
inferred← citeshttps://doi.org/10.1007/s00200-010-0120-6openalex-snapshot
Two new permutation polynomials with the form $${\left(x^{2^k}+x+\delta\right)^{s}+x}$$ over $${\mathbb{F}_{2^n}}$$
inferred← citeshttps://doi.org/10.1007/s00200-018-0353-3openalex-snapshot
Six new classes of permutation trinomials over $$\mathbb {F}_{3^{3k}}$$ F 3 3 k
inferred← citeshttps://doi.org/10.1007/s00200-020-00441-zopenalex-snapshot
Some classes of permutation polynomials of the form $$b(x^q+ax+\delta )^{\frac{i(q^2-1)}{d}+1}+c(x^q+ax+\delta )^{\frac{j(q^2-1)}{d}+1}+L(x)$$ over $$ {{{\mathbb {F}}}}_{q^2}$$
inferred← citeshttps://doi.org/10.1007/s002000050073openalex-snapshot
Some Power Mappings with Low Differential Uniformity
inferred← citeshttps://doi.org/10.1007/s10114-009-6526-zopenalex-snapshot
On permutation polynomials in two variables over ℤ/p 2ℤ
inferred← citeshttps://doi.org/10.1007/s10623-020-00768-1openalex-snapshot
Characterizations and constructions of triple-cycle permutations of the form $$x^rh(x^s)$$
inferred← citeshttps://doi.org/10.1007/s10623-024-01462-2openalex-snapshot
Towards a classification of permutation binomials of the form $$x^i+ax$$ over $${\mathbb {F}}_{2^n}$$
inferred← citeshttps://doi.org/10.1007/s11424-024-2500-1openalex-snapshot
Zeros of Complete Symmetric Polynomials over Finite Fields
inferred← citeshttps://doi.org/10.1007/s11425-008-0142-8openalex-snapshot
Explicit classes of permutation polynomials of % MathType!MTEF!2!1!+- % feaagaart1ev2aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn % hiov2DGi1BTfMBaeXatLxBI9gBqj3BWbIqubWexLMBb50ujbqegm0B % 1jxALjharqqtubsr4rNCHbGeaGqiVu0Je9sqqrpepC0xbbL8F4rqqr % Ffpeea0xe9Lq-Jc9vqaqpepm0xbba9pwe9Q8fs0-yqaqpepae9pg0F…
inferred← citeshttps://doi.org/10.1016/j.amc.2015.12.025openalex-snapshot
A numerical approach with error estimation to solve general integro-differential–difference equations using Dickson polynomials
inferred← citeshttps://doi.org/10.1016/j.dam.2016.05.017openalex-snapshot
Existentially closed graphs via permutation polynomials over finite fields
inferred← citeshttps://doi.org/10.1016/j.ffa.2005.08.005openalex-snapshot
On strong orthogonal systems and weak permutation polynomials over finite commutative rings
inferred← citeshttps://doi.org/10.1016/j.ffa.2006.05.006openalex-snapshot
Four classes of permutation polynomials of F 2 m
inferred← citeshttps://doi.org/10.1016/j.ffa.2008.12.003openalex-snapshot
On inverse permutation polynomials
inferred← citeshttps://doi.org/10.1016/j.ffa.2010.01.003openalex-snapshot
More explicit classes of permutation polynomials of F33m
inferred← citeshttps://doi.org/10.1016/j.ffa.2010.07.001openalex-snapshot
Permutation polynomials of degree 6 or 7 over finite fields of characteristic 2
inferred← citeshttps://doi.org/10.1016/j.ffa.2011.02.012openalex-snapshot
New methods for generating permutation polynomials over finite fields
inferred← citeshttps://doi.org/10.1016/j.ffa.2011.02.013openalex-snapshot
A note on linear permutation polynomials
inferred← citeshttps://doi.org/10.1016/j.ffa.2011.04.001openalex-snapshot
Permutation polynomials over finite fields from a powerful lemma
inferred← citeshttps://doi.org/10.1016/j.ffa.2011.04.002openalex-snapshot
On coefficients of polynomials over finite fields
inferred← citeshttps://doi.org/10.1016/j.ffa.2012.02.003openalex-snapshot
Two classes of permutation polynomials over finite fields
inferred← citeshttps://doi.org/10.1016/j.ffa.2012.02.004openalex-snapshot
On a conjecture of polynomials with prescribed range
inferred← citeshttps://doi.org/10.1016/j.ffa.2012.12.003openalex-snapshot
Permutation polynomials and orthomorphism polynomials of degree six
inferred← citeshttps://doi.org/10.1016/j.ffa.2013.02.005openalex-snapshot
Cyclotomy and permutation polynomials of large indices
inferred← citeshttps://doi.org/10.1016/j.ffa.2014.01.006openalex-snapshot
Further results on permutation polynomials over finite fields
inferred← citeshttps://doi.org/10.1016/j.ffa.2014.03.001openalex-snapshot
WITHDRAWN & REPUBLISHED: Carlitz–Wan conjecture for permutation polynomials and Weil bound for curves over finite fields
inferred← citeshttps://doi.org/10.1016/j.ffa.2014.03.003openalex-snapshot
The compositional inverse of a class of linearized permutation polynomials over F2n , n odd
inferred← citeshttps://doi.org/10.1016/j.ffa.2014.10.001openalex-snapshot
Permutation polynomials over finite fields — A survey of recent advances
inferred← citeshttps://doi.org/10.1016/j.ffa.2014.10.002openalex-snapshot
Constructing permutations and complete permutations over finite fields via subfield-valued polynomials
inferred← citeshttps://doi.org/10.1016/j.ffa.2014.11.010openalex-snapshot
Permutation and complete permutation polynomials
inferred← citeshttps://doi.org/10.1016/j.ffa.2015.05.001openalex-snapshot
Permutation polynomials from piecewise functions
inferred← citeshttps://doi.org/10.1016/j.ffa.2016.09.002openalex-snapshot
New classes of permutation binomials and permutation trinomials over finite fields
inferred← citeshttps://doi.org/10.1016/j.ffa.2017.01.006openalex-snapshot
A note on inverses of cyclotomic mapping permutation polynomials over finite fields
inferred← citeshttps://doi.org/10.1016/j.ffa.2017.03.002openalex-snapshot
Permutation trinomials over F 2 m
inferred← citeshttps://doi.org/10.1016/j.ffa.2019.01.003openalex-snapshot
Further results on complete permutation monomials over finite fields
inferred← citeshttps://doi.org/10.1016/j.ffa.2019.101584openalex-snapshot
Some new forms of permutation polynomials based on the AGW criterion
inferred← citeshttps://doi.org/10.1016/j.jnt.2013.04.011openalex-snapshot
A class of permutation binomials over finite fields
inferred← citeshttps://doi.org/10.1016/j.jnt.2014.04.009openalex-snapshot
Powers of polynomials and bounds of value sets
inferred← citeshttps://doi.org/10.1016/j.jnt.2014.06.021openalex-snapshot
Determination of a type of permutation binomials over finite fields
inferred← citeshttps://doi.org/10.1016/j.jsc.2013.07.004openalex-snapshot
The Carlitz rank of permutations of finite fields: A survey
inferred← citeshttps://doi.org/10.1016/s1071-5797(03)00044-3openalex-snapshot
Enumerating permutation polynomials II: k-cycles with minimal degree
inferred← citeshttps://doi.org/10.1016/s1570-7954(96)80013-1openalex-snapshot
Finite Fields and Their Applications
inferred← citeshttps://doi.org/10.1017/cco9781139696456.016openalex-snapshot
Index bounds for value sets of polynomials over finite fields
inferred← citeshttps://doi.org/10.1017/s0004972713000208openalex-snapshot
ON PERMUTATION BINOMIALS OVER FINITE FIELDS
inferred← citeshttps://doi.org/10.1017/s001309150000626xopenalex-snapshot
The number of permutation polynomials of the form f(x) cx over a finite field
inferred← citeshttps://doi.org/10.1090/conm/632/12628openalex-snapshot
A survey of permutation binomials and trinomials over finite fields
inferred← citeshttps://doi.org/10.1090/s0002-9939-1993-1155603-2openalex-snapshot
Value Sets of Polynomials Over Finite Fields
inferred← citeshttps://doi.org/10.1090/s0002-9947-09-04578-4openalex-snapshot
Permutation binomials over finite fields
inferred← citeshttps://doi.org/10.1090/s0002-9947-1994-1272675-0openalex-snapshot
A Class of Exceptional Polynomials
inferred← citeshttps://doi.org/10.1109/eidwt.2013.58openalex-snapshot
A Note on a Class of Permutation Polynomials
inferred← citeshttps://doi.org/10.1109/itw.2002.1115420openalex-snapshot
Cryptosystems based on polynomials over finite fields
inferred← citeshttps://doi.org/10.1109/itw.2011.6089369openalex-snapshot
Ambiguity and deficiency of permutations from finite fields
inferred← citeshttps://doi.org/10.1109/iwsda46143.2019.8966086openalex-snapshot
Permutation Polynomials from two piecewise functions
inferred← citeshttps://doi.org/10.1109/tit.2008.926426openalex-snapshot
A Note on Permutation Polynomials Over $\BBZ _{n}$
inferred← citeshttps://doi.org/10.1109/tit.2011.2159478openalex-snapshot
Two New Measures for Permutations: Ambiguity and Deficiency
inferred← citeshttps://doi.org/10.1134/s1990478918040105openalex-snapshot
Permutation Binomial Functions over Finite Fields
inferred← citeshttps://doi.org/10.1137/140960153openalex-snapshot
Permutation Trinomials Over Finite Fields with Even Characteristic
inferred← citeshttps://doi.org/10.1137/s0097539794270352openalex-snapshot
Value Sets of Some Polynomials Over Finite Fields
inferred← citeshttps://doi.org/10.1142/s1005386705000155openalex-snapshot
Witt Rings and Permutation Polynomials
inferred← citeshttps://doi.org/10.1142/s1793042108001249openalex-snapshot
ON SOME CLASSES OF PERMUTATION POLYNOMIALS
inferred← citeshttps://doi.org/10.1145/195058.195204openalex-snapshot
The computational complexity of recognizing permutation functions
inferred← citeshttps://doi.org/10.4153/cmb-1990-036-3openalex-snapshot
Proof of a Conjecture of Chowla and Zassenhaus on Permutation Polynomials
inferred← citeshttps://doi.org/10.4171/emss/1openalex-snapshot
Algebraic combinatorial geometry: the polynomial method in arithmetic combinatorics, incidence combinatorics, and number theory
inferred← citeshttps://doi.org/10.4236/jcc.2014.24003openalex-snapshot
Several Classes of Permutation Polynomials over Finite Fields
inferred← citeshttps://doi.org/10.48550/arxiv.2012.00502openalex-snapshot
Determinants concerning Legendre symbols
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.