default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWeiqiong Wang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j12]Qi Zhang, Weiqiong Wang, Shuyu Luo, Yue Li:
Repeated-root constacyclic codes of length klp over finite fields. Finite Fields Their Appl. 101: 102542 (2025)- 2024
- [j11]Shuyu Luo, Weiqiong Wang, Qi Zhang, Zhenjie Song:
Constructions of plateaued correctors with high correction order and good nonlinearity via Walsh spectral neutralization technique. Des. Codes Cryptogr. 92(12): 4531-4548 (2024) - 2022
- [j10]Ziling Heng, Dexiang Li, Fenjin Liu, Weiqiong Wang:
Infinite families of $ t $-designs and strongly regular graphs from punctured codes. Adv. Math. Commun. 16(4): 753-778 (2022) - [j9]Yan Wang, Xilin Han
, Weiqiong Wang, Ziling Heng:
Linear complexity over ${\mathbb {F}_{{q}}}$ and 2-adic complexity of a class of binary generalized cyclotomic sequences with good autocorrelation. Des. Codes Cryptogr. 90(8): 1695-1712 (2022) - 2021
- [j8]Ziling Heng, Weiqiong Wang, Yan Wang:
Projective binary linear codes from special Boolean functions. Appl. Algebra Eng. Commun. Comput. 32(4): 521-552 (2021) - [i3]Yan Wang, Xilin Han, Weiqiong Wang, Ziling Heng:
Linear complexity over Fq and 2-adic complexity of a class of binary generalized cyclotomic sequences with low-value autocorrelation. CoRR abs/2109.02095 (2021) - 2020
- [j7]Yu Zhou, Wei Zhao, Zhixiong Chen, Weiqiong Wang, Xiaoni Du:
On the Signal-to-Noise Ratio for Boolean Functions. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 103-A(12): 1659-1665 (2020) - [j6]Ziling Heng, Cunsheng Ding, Weiqiong Wang:
Optimal Binary Linear Codes From Maximal Arcs. IEEE Trans. Inf. Theory 66(9): 5387-5394 (2020) - [i2]Ziling Heng, Cunsheng Ding, Weiqiong Wang:
Optimal Binary Linear Codes from Maximal Arcs. CoRR abs/2001.01049 (2020)
2010 – 2019
- 2019
- [i1]Weiqiong Wang, Yan Wang:
The parameters of a family of linear codes. CoRR abs/1903.03720 (2019) - 2018
- [j5]Weiqiong Wang, Jennifer Nguyen:
The k-subset sum problem over finite fields. Finite Fields Their Appl. 51: 204-217 (2018) - 2017
- [j4]Weiqiong Wang, Li-Ping Wang, Haiyan Zhou:
Subset sums of quadratic residues over finite fields. Finite Fields Their Appl. 43: 106-122 (2017) - 2015
- [j3]Yu Zhou, Lin Wang, Weiqiong Wang, Xiaoni Du:
Balanced Boolean Functions of σƒ>22n+2n+3(n≥4). IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 98-A(6): 1313-1319 (2015) - 2014
- [j2]Yu Zhou, Lin Wang, Weiqiong Wang, Xinfeng Dong, Xiaoni Du:
One Sufficient and Necessary Condition on Balanced Boolean Functions with σf = 22n + 2n+3(n ≥ 3). Int. J. Found. Comput. Sci. 25(3): 343-354 (2014)
2000 – 2009
- 2005
- [j1]Weiqiong Wang, Xiaolong Xin:
Distance measure between intuitionistic fuzzy sets. Pattern Recognit. Lett. 26(13): 2063-2069 (2005)
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 2025-01-20 22:55 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:
