Qiang Wang
Orcid: 0000-0001-5426-2776Affiliations:
- Carleton University, School of Mathematics and Statistics, Ottawa, Canada
According to our database1,
Qiang Wang
authored at least 90 papers
between 2005 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on scopus.com
-
on orcid.org
On csauthors.net:
Bibliography
2024
Some classes of permutation binomials and trinomials of index q-1 over ${\mathbb {F}_{q^n}}$.
Cryptogr. Commun., March, 2024
Finite Fields Their Appl., 2024
Efficient generation of odd order de Bruijn sequence with the same complement and reverse sequences.
CoRR, 2024
2023
Finite Fields Their Appl., 2023
2022
Finite Fields Their Appl., 2022
Finite Fields Their Appl., 2022
Finite Fields Their Appl., 2022
Finite Fields Their Appl., 2022
Appl. Algebra Eng. Commun. Comput., 2022
2021
IEEE Trans. Inf. Theory, 2021
IEEE Trans. Inf. Theory, 2021
Quantum Inf. Process., 2021
Finite Fields Their Appl., 2021
On enumeration of irreducible polynomials and related objects over a finite field with respect to their trace and norm.
Finite Fields Their Appl., 2021
2020
IEEE Trans. Inf. Theory, 2020
Finite Fields Their Appl., 2020
A general method for finding the compositional inverses of permutations from the AGW criterion.
CoRR, 2020
Appl. Algebra Eng. Commun. Comput., 2020
Special Issue: "Computer Algebra and Application to Combinatorics, Coding Theory and Cryptography" ACA 2019, Montreal, Canada, July 16-20, 2019.
Appl. Algebra Eng. Commun. Comput., 2020
2019
IEEE Trans. Inf. Theory, 2019
Finite Fields Their Appl., 2019
A recursive construction of permutation polynomials over F<sub>q<sup>2</sup></sub> with odd characteristic related to Rédei functions.
Des. Codes Cryptogr., 2019
General Criteria for Successor Rules to Efficiently Generate Binary de Bruijn Sequences.
CoRR, 2019
Cryptogr. Commun., 2019
Compositional inverses of permutation polynomials of the form x r h(x s ) over finite fields.
Cryptogr. Commun., 2019
Appl. Algebra Eng. Commun. Comput., 2019
2018
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2018
New constructions of permutation polynomials of the form x<sup>r</sup> h(x <sup>q - 1</sup>) over 𝔽<sub>q<sup>2</sup></sub>.
Des. Codes Cryptogr., 2018
The exact autocorrelation distribution and 2-adic complexity of a class of binary sequences with almost optimal autocorrelation.
Cryptogr. Commun., 2018
2017
Finite Fields Their Appl., 2017
Ambiguity, deficiency and differential spectrum of normalized permutation polynomials over finite fields.
Finite Fields Their Appl., 2017
Discret. Appl. Math., 2017
New Constructions of Permutation Polynomials of the Form $x^rh\left(x^{q-1}\right)$ over $\mathbb{F}_{q^2}$.
CoRR, 2017
A lower bound on the 2-adic complexity of Whiteman's generalized cyclotomic sequences of order 4 with length pq.
Proceedings of the Eighth International Workshop on Signal Design and Its Applications in Communications, 2017
2016
Des. Codes Cryptogr., 2016
2015
SIAM J. Discret. Math., 2015
Finite Fields Their Appl., 2015
CoRR, 2015
CoRR, 2015
Cryptogr. Commun., 2015
2014
Finite Fields Their Appl., 2014
Finite Fields Their Appl., 2014
Compositional inverses, complete mappings, orthogonal Latin squares and bent functions.
CoRR, 2014
Proceedings of the Applied Algebra and Number Theory, 2014
2013
Ambiguity and Deficiency of Permutations Over Finite Fields With Linearized Difference Map.
IEEE Trans. Inf. Theory, 2013
Finite Fields Their Appl., 2013
Des. Codes Cryptogr., 2013
Proceedings of the 8th Conference on the Theory of Quantum Computation, 2013
One variable.
Proceedings of the Handbook of Finite Fields., 2013
Dickson polynomials.
Proceedings of the Handbook of Finite Fields., 2013
2012
Finite Fields Their Appl., 2012
Des. Codes Cryptogr., 2012
Des. Codes Cryptogr., 2012
Proceedings of the Sequences and Their Applications - SETA 2012, 2012
2011
IEEE Trans. Inf. Theory, 2011
Proceedings of the 2011 IEEE Information Theory Workshop, 2011
2010
IEEE Trans. Computers, 2010
The number of irreducible polynomials of degree n over F<sub>q</sub> with given trace and constant terms.
Discret. Math., 2010
Proceedings of the LATIN 2010: Theoretical Informatics, 2010
2009
2008
An answer to Hirasaka and Muzychuk: Every p-Schur ring over C<sup>p</sup><sub>p</sub> is Schurian.
Discret. Math., 2008
2007
Des. Codes Cryptogr., 2007
Proceedings of the Sequences, Subsequences, and Consequences, International Workshop, 2007
2006
The Number of Permutation Binomials over F<sub>4p+1</sub> where p and 4p+1 are Primes.
Electron. J. Comb., 2006
2005