Binary sequences derived from monomial permutation polynomials over \(\mathrm{GF}(2^p)\)
From MaRDI portal
Publication:2151316
DOI10.1007/978-3-030-88323-2_20zbMath1495.11135OpenAlexW3207293900MaRDI QIDQ2151316
Yupeng Jiang, Wen-Feng Qi, Qun-Xiong Zheng, Dong-Dai Lin
Publication date: 1 July 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-88323-2_20
Cites Work
- Unnamed Item
- Unnamed Item
- Random number generators for parallel processors
- General constructions of permutation polynomials of the form \((x^{2^m} + x + \delta)^{i(2^m - 1) + 1} + x\) over \(\mathbb{F}_{2^{2 m}}\)
- A class of permutation trinomials over finite fields of odd characteristic
- On constructing complete permutation polynomials over finite fields of even characteristic
- Further results on complete permutation monomials over finite fields
- Complete permutation polynomials with the form \((x^{p^m} - x + \delta)^s + a x^{p^m} + b x\) over \(\mathbb{F}_{p^n}\)
- Permutation polynomials over finite fields -- a survey of recent advances
- Handbook of Finite Fields
- Random Number Generators on Vector Supercomputers and Other Advanced Architectures
- Design and Analysis of Parallel Monte Carlo Algorithms
- Pseudorandom vector generation by the inversive method
- Two classes of permutation trinomials with Niho exponents
This page was built for publication: Binary sequences derived from monomial permutation polynomials over \(\mathrm{GF}(2^p)\)
