Qiang Wang

Orcid: 0000-0001-5426-2776

Affiliations:
  • 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:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Additive codes with few weights.
Cryptogr. Commun., September, 2024

Some classes of permutation binomials and trinomials of index q-1 over ${\mathbb {F}_{q^n}}$.
Cryptogr. Commun., March, 2024

Constructing permutation polynomials from permutation polynomials of subfields.
Finite Fields Their Appl., 2024

On the stable polynomials of degrees 2,3,4.
Finite Fields Their Appl., 2024

On many-to-one mappings over finite fields.
CoRR, 2024

Efficient generation of odd order de Bruijn sequence with the same complement and reverse sequences.
CoRR, 2024

The complexity of elliptic normal bases.
CoRR, 2024

2023
In Memory of Professor Zhexian Wan.
Finite Fields Their Appl., December, 2023

Generalized Lucas polynomials over finite fields.
Finite Fields Their Appl., 2023

Two-weight or three-weight binary linear codes from cyclotomic mappings.
Finite Fields Their Appl., 2023

2022
The additive index of polynomials over finite fields.
Finite Fields Their Appl., 2022

On the enumeration of polynomials with prescribed factorization pattern.
Finite Fields Their Appl., 2022

Counting irreducible polynomials with prescribed coefficients over a finite field.
Finite Fields Their Appl., 2022

Coset-wise affine functions and cycle types of complete mappings.
Finite Fields Their Appl., 2022

Further improvement on index bounds.
Des. Codes Cryptogr., 2022

On the stability of periodic binary sequences with zone restriction.
Appl. Algebra Eng. Commun. Comput., 2022

2021
Finding Compositional Inverses of Permutations From the AGW Criterion.
IEEE Trans. Inf. Theory, 2021

A Framework of Constructing Placement Delivery Arrays for Centralized Coded Caching.
IEEE Trans. Inf. Theory, 2021

A family of Hermitian dual-containing constacyclic codes and related quantum codes.
Quantum Inf. Process., 2021

Several classes of complete permutation polynomials with Niho exponents.
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

An efficiently generated family of binary de Bruijn sequences.
Discret. Math., 2021

2020
On Inverses of Permutation Polynomials of Small Degree Over Finite Fields.
IEEE Trans. Inf. Theory, 2020

Cycle Structures of a Class of Cascaded FSRs.
IEEE Trans. Inf. Theory, 2020

The dynamics of permutations on irreducible polynomials.
Finite Fields Their Appl., 2020

A general method for finding the compositional inverses of permutations from the AGW criterion.
CoRR, 2020

A Graph Joining Greedy Approach to Binary de Bruijn Sequences.
CoRR, 2020

New constructions of involutions over finite fields.
Cryptogr. Commun., 2020

Boomerang uniformity of normalized permutation polynomials of low degree.
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
On the Derivative Imbalance and Ambiguity of Functions.
IEEE Trans. Inf. Theory, 2019

A Generalized Grouping Scheme in Coded Caching.
IEEE Trans. Commun., 2019

Further results on complete permutation monomials over finite fields.
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

Improved bounds on 2-frameproof codes with length 4.
Des. Codes Cryptogr., 2019

General Criteria for Successor Rules to Efficiently Generate Binary de Bruijn Sequences.
CoRR, 2019

A lower bound on the 2-adic complexity of the modified Jacobi sequence.
Cryptogr. Commun., 2019

Compositional inverses of permutation polynomials of the form x r h(x s ) over finite fields.
Cryptogr. Commun., 2019

Fixed points of rational functions satisfying the Carlitz property.
Appl. Algebra Eng. Commun. Comput., 2019

2018
A Property of a Class of Gaussian Periods and Its Application.
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

Counting Compositions over Finite Abelian Groups.
Electron. J. Comb., 2018

Characteristic digit-sum sequences.
Cryptogr. Commun., 2018

The exact autocorrelation distribution and 2-adic complexity of a class of binary sequences with almost optimal autocorrelation.
Cryptogr. Commun., 2018

Nonlinear vectorial primitive recursive sequences.
Cryptogr. Commun., 2018

2017
A note on inverses of cyclotomic mapping permutation polynomials over finite fields.
Finite Fields Their Appl., 2017

Ambiguity, deficiency and differential spectrum of normalized permutation polynomials over finite fields.
Finite Fields Their Appl., 2017

Compositional inverses and complete mappings over finite fields.
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
Index bounds for character sums of polynomials over finite fields.
Des. Codes Cryptogr., 2016

2015
Permutation Trinomials Over Finite Fields with Even Characteristic.
SIAM J. Discret. Math., 2015

A probabilistic approach to value sets of polynomials over finite fields.
Finite Fields Their Appl., 2015

Linearized Wenger graphs.
Discret. Math., 2015

On coefficients of powers of polynomials and their compositions over finite fields.
CoRR, 2015

An asymptotic formula for the number of irreducible transformation shift registers.
CoRR, 2015

Linear complexity profile and correlation measure of interleaved sequences.
Cryptogr. Commun., 2015

2014
On the inverses of some classes of permutations of finite fields.
Finite Fields Their Appl., 2014

Roots and coefficients of polynomials over finite fields.
Finite Fields Their Appl., 2014

Compositional inverses, complete mappings, orthogonal Latin squares and bent functions.
CoRR, 2014

General conditional recurrences.
Appl. Math. Comput., 2014

Index bounds for value sets of polynomials over finite fields.
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

A Family of Fibonacci-Like Conditional Sequences.
Integers, 2013

Cyclotomy and permutation polynomials of large indices.
Finite Fields Their Appl., 2013

Composed products and factors of cyclotomic polynomials over finite fields.
Des. Codes Cryptogr., 2013

Partitions and Compositions over Finite Fields.
Electron. J. Comb., 2013

Symmetries of Codeword Stabilized Quantum Codes.
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
Dickson polynomials over finite fields.
Finite Fields Their Appl., 2012

On a conjecture of polynomials with prescribed range.
Finite Fields Their Appl., 2012

On explicit factors of cyclotomic polynomials over finite fields.
Des. Codes Cryptogr., 2012

Divisibility of polynomials over finite fields and combinatorial applications.
Des. Codes Cryptogr., 2012

Generalized Alcuin's Sequence.
Electron. J. Comb., 2012

Word-Oriented Transformation Shift Registers and Their Linear Complexity.
Proceedings of the Sequences and Their Applications - SETA 2012, 2012

2011
Two New Measures for Permutations: Ambiguity and Deficiency.
IEEE Trans. Inf. Theory, 2011

On coefficients of polynomials over finite fields.
Finite Fields Their Appl., 2011

On constructing permutations of finite fields.
Finite Fields Their Appl., 2011

Ambiguity and deficiency of permutations from finite fields.
Proceedings of the 2011 IEEE Information Theory Workshop, 2011

2010
A Karatsuba-Based Algorithm for Polynomial Multiplication in Chebyshev Form.
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

Ambiguity and Deficiency in Costas Arrays and APN Permutations.
Proceedings of the LATIN 2010: Theoretical Informatics, 2010

2009
On inverse permutation polynomials.
Finite Fields Their Appl., 2009

On permutation polynomials of prescribed shape.
Finite Fields Their Appl., 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
Division of trinomials by pentanomials and orthogonal arrays.
Des. Codes Cryptogr., 2007

Cyclotomic Mapping Permutation Polynomials over Finite Fields.
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
On some permutation polynomials over finite fields.
Int. J. Math. Math. Sci., 2005


  Loading...