Further results on permutation polynomials over finite fields (Q2253094): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: On constructing permutations of finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Codes From Perfect Nonlinear Mappings and Their Secret Sharing Schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: New methods for generating permutation polynomials over finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: When does \(G(x)+\gamma \, \text{Tr}(H(x))\) permute \(\mathbb F_{p^n}\)? / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Class of Permutation Polynomials over $\mathbb{F}_{2^n}$ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Ternary Cyclic Codes From Monomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: A family of skew Hadamard difference sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Explicit classes of permutation polynomials of \(\mathbb F_{3^{3m}}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing permutations of finite fields via linear translators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Permutation polynomials and applications to coding theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Further results on a class of permutation polynomials over finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two classes of permutation polynomials over finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reversed Dickson polynomials over finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Permutation Polynomials in RSA-Cryptosystems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3765876 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Specific permutation polynomials over finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3136948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A method for obtaining digital signatures and public-key cryptosystems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cyclotomic Mapping Permutation Polynomials over Finite Fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: The weight distribution of a class of linear codes from perfect nonlinear functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Permutation polynomials over finite fields from a powerful lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two new permutation polynomials with the form \({\left(x^{2^k}+x+\delta\right)^{s}+x}\) over \({\mathbb{F}_{2^n}}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two classes of permutation polynomials over finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: SOME FAMILIES OF PERMUTATION POLYNOMIALS OVER FINITE FIELDS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classes of Permutation Polynomials Based on Cyclotomy and an Additive Analogue / rank
 
Normal rank

Revision as of 18:46, 8 July 2024

scientific article
Language Label Description Also known as
English
Further results on permutation polynomials over finite fields
scientific article

    Statements

    Further results on permutation polynomials over finite fields (English)
    0 references
    0 references
    0 references
    25 July 2014
    0 references
    Let \(\mathbb F_{q^n}\) be a finite field. The main result of the paper is: Suppose \(g(x)\in\mathbb F_{q^n}[x]\) satisfies \(g(x)^q=g(x)\) for all \(x\in \mathbb F_{q^n}\), and let \(L(x)\) be a linearized polynomial. For every \(\delta\in \mathbb F_{q^n}\), \[ f(x)=g(x^q-x+\delta)+L(x) \] permutes \(\mathbb F_{q^n}\) if and only if \(L(x)\) does. The authors use this to unify some previous constructions of permutation polynomials and to construct new ones. Typos have been corrected in the corrigenda [ibid. 30, 153--154 (2014; Zbl 1297.11150)].
    0 references
    permutation polynomials
    0 references
    linearized polynomials
    0 references
    skew Hadamard difference sets
    0 references
    0 references
    0 references

    Identifiers