#### Filter Results:

- Full text PDF available (3)

#### Publication Year

2005

2017

- This year (1)
- Last 5 years (4)
- Last 10 years (10)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Harald Niederreiter, Li-Ping Wang
- INDOCRYPT
- 2005

- Li-Ping Wang, Harald Niederreiter
- Finite Fields and Their Applications
- 2006

- Li-Ping Wang, Qiang Wang
- Des. Codes Cryptography
- 2012

We study the explicit factorization of 2nr-th cyclotomic polynomials over finite field Fq where q, r are odd with (r, q) = 1. We show that all irreducible factors of 2nr-th cyclotomic polynomials can be obtained easily from irreducible factors of cyclotomic polynomials of small orders. In particular, we obtain the explicit factorization of 2n5-th cyclotomic… (More)

- Li-Ping Wang
- AAECC
- 2006

- Xiwang Cao, Mei Lu, Daqing Wan, Li-Ping Wang, Qiang Wang
- Discrete Mathematics
- 2015

Motivated by recent extensive studies on Wenger graphs, we introduce a new infinite class of bipartite graphs of the similar type, called linearized Wenger graphs. The spectrum, diameter and girth of these linearized Wenger graphs are determined.

- Li-Ping Wang, Harald Niederreiter
- J. Complexity
- 2008

In this paper we use the successive minima profile to measure structural properties of pseudorandom multisequences.We show that both the lattice profile and the joint linear complexity profile of amultisequence can be expressed in terms of the successive minima profile. © 2007 Elsevier Inc. All rights reserved.

- Li-Ping Wang
- Cryptography and Communications
- 2010

In this paper we first extend a minimal partial realization algorithm from vector sequences to matrix sequences of equal length by means of a lattice basis reduction algorithm over polynomial rings. We also give all minimal partial realizations for such matrix sequences and a sufficient and necessary condition for the uniqueness issue. Then we improve the… (More)

- Li-Ping Wang
- Finite Fields and Their Applications
- 2011

- Li-Ping Wang
- 2009 IEEE International Symposium on Information…
- 2009

In this paper we give an algorithm for computing a bidirectional minimal polynomial (a characteristic polynomial with not only minimal degree but also a nonzero constant term) of a given finite-length multisequence by modifying a lattice-based linear feedback shift register synthesis algorithm for multisequences. We also describe the set of all such… (More)

- Li-Ping Wang
- Finite Fields and Their Applications
- 2008