default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLi-Ping Wang 0001
Person information
- affiliation: Tsinghua University
- affiliation: National University of Singapore
Other persons with the same name
- Li-Ping Wang — disambiguation page
- Li-Ping Wang 0002 — Hebei Normal University
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2019
[j11]Xiutao Feng, Dongdai Lin, Li-Ping Wang, Qiang Wang:
Further results on complete permutation monomials over finite fields. Finite Fields Their Appl. 57: 47-59 (2019)- 2018
- [j10]Weijun Fang, Li-Ping Wang, Daqing Wan:
On deep holes of Gabidulin codes. Finite Fields Their Appl. 54: 216-229 (2018) - 2015
- [j9]Xiwang Cao, Mei Lu, Daqing Wan, Li-Ping Wang, Qiang Wang
:
Linearized Wenger graphs. Discret. Math. 338(9): 1595-1602 (2015) - 2014
- [j8]Mei Lu, Daqing Wan, Li-Ping Wang, Xiao-Dong Zhang:
Algebraic Cayley graphs over finite fields. Finite Fields Their Appl. 28: 43-56 (2014) - 2012
- [j7]Harald Niederreiter, Michael Vielhaber, Li-Ping Wang:
Improved results on the probabilistic theory of the joint linear complexity of multisequences. Sci. China Inf. Sci. 55(1): 165-170 (2012) - [j6]Li-Ping Wang, Qiang Wang:
On explicit factors of cyclotomic polynomials over finite fields. Des. Codes Cryptogr. 63(1): 87-104 (2012) - 2011
- [j5]Li-Ping Wang:
A lattice-based minimal partial realization algorithm for matrix sequences of varying length. Cryptogr. Commun. 3(1): 29-42 (2011) - [j4]Li-Ping Wang:
On minimal polynomials over Fqm and over Fq of a finite-length sequence over Fqm.. Finite Fields Their Appl. 17(3): 294-301 (2011) - 2008
- [j3]Li-Ping Wang:
Lattice basis reduction algorithms and multi-dimensional continued fractions. Finite Fields Their Appl. 14(4): 979-991 (2008) - [j2]Li-Ping Wang, Harald Niederreiter:
Successive minima profile, lattice profile, and joint linear complexity profile of pseudorandom multisequences. J. Complex. 24(2): 144-153 (2008) - 2006
- [j1]Li-Ping Wang, Harald Niederreiter:
Enumeration results on the joint linear complexity of multisequences. Finite Fields Their Appl. 12(4): 613-637 (2006)
Conference and Workshop Papers
- 2009
- [c4]Li-Ping Wang:
An algorithm for computing bidirectional minimal polynomials for multisequences. ISIT 2009: 621-624 - 2008
- [c3]Li-Ping Wang:
A Lattice-Based Minimal Partial Realization Algorithm. SETA 2008: 278-289 - 2006
- [c2]Li-Ping Wang:
The Vector Key Equation and Multisequence Shift Register Synthesis. AAECC 2006: 68-75 - 2005
- [c1]Harald Niederreiter, Li-Ping Wang:
Proof of a Conjecture on the Joint Linear Complexity Profile of Multisequences. INDOCRYPT 2005: 13-22
Informal and Other Publications
- 2017
- [i1]Weijun Fang, Li-Ping Wang, Daqing Wan:
On deep-holes of Gabidulin codes. CoRR abs/1711.11202 (2017)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-04 21:38 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
