Skip to search formSkip to main contentSkip to account menu

Permutation polynomial

Known as: Permutation polynomials, Schur's conjecture 
In mathematics, a permutation polynomial (for a given ring) is a polynomial that acts as a permutation of the elements of the ring, i.e. the map is a… 
Wikipedia (opens in a new tab)

Related topics

Related topics

7 relations
Chebyshev polynomialsDickson polynomialError detection and correctionForward error correction

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
A New Approach to Constructing Quadratic Pseudo-Planar Functions Over $ {\mathbb F}_{2^{n}}$
Planar functions over finite fields give rise to finite projective planes. They were also used in the constructions of DES-like… 
2011
2011
Further Results on Quadratic Permutation Polynomial-Based Interleavers for Turbo Codes
An interleaver is a critical component for the chan- nel coding performance of turbo codes. Algebraic constructions are of… 
2010
2010
Self-inverse interleavers based on permutation functions for turbo codes
In this work we introduce and study a set of new interleavers based on permutation functions with known inverses over a finite… 
2007
2007
A note on "a simple coefficient test for cubic permutation polynomials over integer rings"
In this short note, an inadvertent omission in the above-named article by Y.-L. Chen, et al., [ibid., vol. 10, no. 7, pp. 549-551… 
2006
2006
A New Metric for Permutation Polynomial Interleavers
  • O. Takeshita
  • IEEE International Symposium on Information…
  • 2006
  • Corpus ID: 11276216
The spread factor of an interleaver is a common measure for turbo coding applications. Maximum-spread interleavers are… 
2006
2006
Optimum Distance Quadratic Permutation Polynomial-Based Interleavers for Turbo Codes
An interleaver is a critical component for the channel coding performance of turbo codes. Algebraic constructions are of… 
2005
2005
On some permutation polynomials over finite fields
Let p be prime, q=pm, and q−1=7s. We completely describe the permutation behavior of the binomial P(x)=xr(1 
2001
2001
Permutation Polynomials Modulo
We give an exact characterization of permutation polynomials mod ulo n w w a polynomial P x a a x adx d with integral coe cients… 
2000
2000
A transform approach to permutation groups of cyclic codes over Galois rings
Berger and Charpin (see ibid., vol.42, p.2194-2209, 1996 and Des., Codes Cuyptogr., vol.18, no.1/3, p.29-53, 1999) devised a… 
1992
1992
A deterministic test for permutation polynomials
A new deterministic algorithm is presented for testing whether a given polynomial of degreen over a finite field ofq elements is… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)