default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWen-Ching Winnie Li
Person information
- affiliation: The Pennsylvania State University, University Park, PA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2011
[p1]Wen-Ching W. Li:
Zeta Functions of Group Based Graphs and Complexes. WIN - Women in Numbers 2011: 225-236
2000 – 2009
- 2009
- [c4]Wen-Ching Winnie Li, Min Lu, Chenying Wang:
Recent Developments in Low-Density Parity-Check Codes. IWCC 2009: 107-123 - 2006
- [j10]Wen-Ching Winnie Li:
Character sums over norm groups. Finite Fields Their Appl. 12(1): 1-15 (2006) - 2005
- [j9]Wen-Ching Winnie Li, Yotsanan Meemark:
Ramanujan graphs on cosets of PGL2(F2). Finite Fields Their Appl. 11(3): 511-543 (2005) - [i2]Ralf Koetter, Wen-Ching W. Li, Pascal O. Vontobel, Judy L. Walker:
Pseudo-Codewords of Cycle Codes via Zeta Functions. CoRR abs/cs/0502033 (2005) - [i1]Ralf Koetter, Wen-Ching W. Li, Pascal O. Vontobel, Judy L. Walker:
Characterizations of Pseudo-Codewords of LDPC Codes. CoRR abs/cs/0508049 (2005) - 2004
- [c3]Ralf Koetter, Wen-Ching W. Li, Pascal O. Vontobel, Judy L. Walker:
Pseudo-codewords of cycle codes via zeta functions. ITW 2004: 7-12 - 2002
- [c2]Wen-Ching W. Li, Hiren Maharaj
, Henning Stichtenoth, Noam D. Elkies:
New Optimal Tame Towers of Function Fields over Small Finite Fields. ANTS 2002: 372-389 - [c1]Wen-Ching W. Li, Mats Näslund, Igor E. Shparlinski:
Hidden Number Problem with the Trace and Bit Security of XTR and LUC. CRYPTO 2002: 433-448
1990 – 1999
- 1999
- [j8]Biao Gao, Frank K. Hwang, Wen-Ching Winnie Li, Uriel G. Rothblum:
Partition polytopes over 1-dimensional points. Math. Program. 85(2): 335-362 (1999) - 1997
- [j7]A. Robert Calderbank, Wen-Ching W. Li, Bjorn Poonen:
A 2-adic approach to the analysis of cyclic codes. IEEE Trans. Inf. Theory 43(3): 977-986 (1997) - 1996
- [j6]Wen-Ching Winnie Li, Patrick Solé:
Spectra of Regular Graphs and Hypergraphs and Orthogonal Polynomials. Eur. J. Comb. 17(5): 461-477 (1996) - 1993
- [j5]Xiao-Dong Hu, Frank K. Hwang, Wen-Ch'ing Winnie Li:
Most reliable double loop networks in survival reliability. Networks 23(5): 451-458 (1993)
1980 – 1989
- 1983
- [j4]Wen-Ching Winnie Li:
Determination of the residue classes of a polynomial at integral arguments. Discret. Math. 47: 83-90 (1983) - 1981
- [j3]Shuo-Yen Robert Li, Wen-Ch'ing Winnie Li:
Independence numbers of graphs and generators of ideals. Comb. 1(1): 55-61 (1981) - [j2]Ronald L. Graham, Wen-Ching Winnie Li, Jerome L. Paul:
Homogeneous Collinear Sets in Partitions of Zn. J. Comb. Theory A 31(1): 21-32 (1981) - 1980
- [j1]Ronald L. Graham, Shuo-Yen Robert Li, Wen-Ching Winnie Li:
On the Structure of t-Designs. SIAM J. Algebraic Discret. Methods 1(1): 8-14 (1980)
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-10-07 22:08 CEST 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:
