Proof of a Conjecture on the Joint Linear Complexity Profile of Multisequences. - Harald Niederreiter; Li-Ping Wang 001 (INDOCRYPT, 2005)

The Vector Key Equation and Multisequence Shift Register Synthesis. - Li-Ping Wang 001 (AAECC, 2006)

Enumeration results on the joint linear complexity of multisequences. - Li-Ping Wang 001; Harald Niederreiter (Finite Fields Their Appl., 2006)

A Lattice-Based Minimal Partial Realization Algorithm. - Li-Ping Wang 001 (SETA, 2008)

Lattice basis reduction algorithms and multi-dimensional continued fractions. - Li-Ping Wang 001 (Finite Fields Their Appl., 2008)

Successive minima profile, lattice profile, and joint linear complexity profile of pseudorandom multisequences. - Li-Ping Wang 001; Harald Niederreiter (J. Complex., 2008)

An algorithm for computing bidirectional minimal polynomials for multisequences. - Li-Ping Wang 001 (ISIT, 2009)

A lattice-based minimal partial realization algorithm for matrix sequences of varying length. - Li-Ping Wang 001 (Cryptogr. Commun., 2011)

On minimal polynomials over Fqm and over Fq of a finite-length sequence over Fqm.. - Li-Ping Wang 001 (Finite Fields Their Appl., 2011)

Improved results on the probabilistic theory of the joint linear complexity of multisequences. - Harald Niederreiter; Michael Vielhaber 001; Li-Ping Wang 001 (Sci. China Inf. Sci., 2012)

On explicit factors of cyclotomic polynomials over finite fields. - Li-Ping Wang 001; Qiang Wang 012 (Des. Codes Cryptogr., 2012)

Algebraic Cayley graphs over finite fields. - Mei Lu; Daqing Wan; Li-Ping Wang 001; Xiao-Dong Zhang 001 (Finite Fields Their Appl., 2014)

Linearized Wenger graphs. - Xiwang Cao; Mei Lu; Daqing Wan; Li-Ping Wang 001; Qiang Wang 012 (Discret. Math., 2015)

On deep holes of Gabidulin codes. - Weijun Fang; Li-Ping Wang 001; Daqing Wan (Finite Fields Their Appl., 2018)

Further results on complete permutation monomials over finite fields. - Xiutao Feng; Dongdai Lin; Li-Ping Wang 001; Qiang Wang 012 (Finite Fields Their Appl., 2019)