A detailed description of the binomial theorem and an application to permutation binomials over finite fields
From MaRDI portal
Publication:2143794
DOI10.1007/s12190-021-01525-wzbMath1487.05016OpenAlexW3138781837MaRDI QIDQ2143794
Ningjing Huang, Zhilin Zhang, Lang Tang
Publication date: 31 May 2022
Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12190-021-01525-w
Combinatorial identities, bijective combinatorics (05A19) Permutations, words, matrices (05A05) Polynomials over finite fields (11T06)
Cites Work
- On permutation polynomials
- A family of skew Hadamard difference sets
- Permutation polynomials and applications to coding theory
- Permutation polynomials over finite fields -- a survey of recent advances
- A survey of permutation binomials and trinomials over finite fields
- When Does a Polynomial Over a Finite Field Permute the Elements of the Field?
- When Does a Polynomial over a Finite Field Permute the Elements of the Field?, II
- A method for obtaining digital signatures and public-key cryptosystems
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A detailed description of the binomial theorem and an application to permutation binomials over finite fields