default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDQunying Liao
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j24]Canze Zhu, Qunying Liao:
Several classes of new projective three-weight or four-weight linear codes and their applications in $ s $-sum sets. Adv. Math. Commun. 18(6): 1662-1680 (2024)- [j23]Canze Zhu, Qunying Liao:
The $ b $-weight distribution for MDS codes. Adv. Math. Commun. 18(6): 1893-1910 (2024) - [j22]Canze Zhu, Qunying Liao:
The [1, 0]-twisted generalized Reed-Solomon code. Cryptogr. Commun. 16(4): 857-878 (2024) - [j21]Boyi He, Qunying Liao:
The properties and the error-correcting pair for lengthened GRS codes. Des. Codes Cryptogr. 92(1): 211-225 (2024) - [j20]Canze Zhu, Qunying Liao:
The (+)-extended twisted generalized Reed-Solomon code. Discret. Math. 347(2): 113749 (2024) - [j19]Canze Zhu, Qunying Liao:
A class of double-twisted generalized Reed-Solomon codes. Finite Fields Their Appl. 95: 102395 (2024) - 2023
- [j18]Boyi He, Qunying Liao:
The error-correcting pair for TGRS codes. Discret. Math. 346(9): 113497 (2023) - [j17]Canze Zhu, Qunying Liao:
Two new classes of projective two-weight linear codes. Finite Fields Their Appl. 88: 102186 (2023) - [j16]Boyi He, Qunying Liao:
On the error-correcting pair for MDS linear codes with even minimum distance. Finite Fields Their Appl. 89: 102210 (2023) - [j15]Canze Zhu, Qunying Liao:
A new construction for q-ary constant weight codes. Finite Fields Their Appl. 89: 102213 (2023) - [j14]Zeyu Ye
, Qunying Liao:
On the Ding and Helleseth's 7th open problem about optimal ternary cyclic codes. Finite Fields Their Appl. 92: 102284 (2023) - [i15]Canze Zhu, Qunying Liao, Haibo Liu:
Infinite families 2-designs from binary projective three-weight codes. CoRR abs/2312.13701 (2023) - 2022
- [i14]Canze Zhu, Qunying Liao:
Self-orthogonal generalized twisted Reed-Solomon codes. CoRR abs/2201.02758 (2022) - [i13]Haibo Liu, Qunying Liao:
A New Constructions of Minimal Binary Linear Codes. CoRR abs/2201.02981 (2022) - [i12]Canze Zhu, Qunying Liao:
The non-GRS properties for the twisted generalized Reed-Solomon code and its extended code. CoRR abs/2204.11955 (2022) - [i11]Canze Zhu, Qunying Liao:
The (+)-extended twisted generalized Reed-Solomon code. CoRR abs/2211.04511 (2022) - [i10]Canze Zhu, Qunying Liao:
Several classes of projective few-weight linear codes and their applications. CoRR abs/2211.04519 (2022) - [i9]Canze Zhu, Qunying Liao:
The [1, 0]-twisted generalized Reed-Solomon code. CoRR abs/2211.05119 (2022) - 2021
- [j13]Canze Zhu, Qunying Liao:
Complete weight enumerators for several classes of two-weight and three-weight linear codes. Finite Fields Their Appl. 75: 101897 (2021) - [j12]Chunming Tang, Yan Qiu, Qunying Liao, Zhengchun Zhou:
Full Characterization of Minimal Linear Codes as Cutting Blocking Sets. IEEE Trans. Inf. Theory 67(6): 3690-3700 (2021) - [i8]Canze Zhu, Qunying Liao:
The b-weight distribution for MDS codes. CoRR abs/2107.01717 (2021) - [i7]Canze Zhu, Qunying Liao:
Two new classes of projective two-weight linear codes. CoRR abs/2107.02446 (2021) - [i6]Canze Zhu, Qunying Liao:
Complete weight enumerators for several classes of two-weight and three-weight linear codes. CoRR abs/2107.02447 (2021) - [i5]Haibo Liu, Qunying Liao:
Two Constructions for Minimal Ternary Linear Codes. CoRR abs/2107.04992 (2021) - [i4]Canze Zhu, Qunying Liao:
Self-dual twisted generalized Reed-Solomon codes. CoRR abs/2111.11901 (2021) - [i3]Canze Zhu, Qunying Liao:
The construction for several few-weight linear codes and their applications. CoRR abs/2112.06027 (2021) - [i2]Canze Zhu, Qunying Liao:
The complete weight enumerator of the Reed-Solomon code with dimension two or three. CoRR abs/2112.14067 (2021) - 2020
- [j11]Sisheng Chen, Chin-Chen Chang, Qunying Liao:
Fidelity Preserved Data Hiding in Encrypted Images Based on Homomorphism and Matrix Embedding. IEEE Access 8: 22345-22356 (2020)
2010 – 2019
- 2019
- [j10]Haibo Liu, Qunying Liao:
Several classes of linear codes with a few weights from defining sets over $$\mathbb {F}_p+u\mathbb {F}_p$$ F p + u F p. Des. Codes Cryptogr. 87(1): 15-29 (2019) - [j9]Haibo Liu, Qunying Liao, Xiaofeng Wang:
Complete Weight Enumerator for a Class of Linear Codes from Defining Sets and Their Applications. J. Syst. Sci. Complex. 32(3): 947-969 (2019) - [j8]Xiaoping Li, Ting-Zhu Huang, Qunying Liao, Xiang-Gen Xia:
Optimal Estimates of Two Common Remainders for a Robust Generalized Chinese Remainder Theorem. IEEE Trans. Signal Process. 67(7): 1824-1837 (2019) - [i1]Chunming Tang, Yan Qiu, Qunying Liao, Zhengchun Zhou:
Full Characterization of Minimal Linear Codes as Cutting Blocking Sets. CoRR abs/1911.09867 (2019) - 2016
- [j7]Haibo Liu, Qunying Liao:
Some New Constructions for Generalized Zero-Difference Balanced Functions. Int. J. Found. Comput. Sci. 27(8): 897-908 (2016) - 2015
- [j6]Qunying Liao, Juan Zhu:
A Note on Optimal Constant Dimension Codes. Int. J. Found. Comput. Sci. 26(1): 143-152 (2015) - 2014
- [j5]Xiyong Zhang, Rongquan Feng, Qunying Liao, Xuhong Gao:
Finding normal bases over finite fields with prescribed trace self-orthogonal relations. Finite Fields Their Appl. 28: 1-21 (2014) - [j4]Qunying Liao, Huan Liao:
On m-MDS codes over finite fields. Int. J. Comput. Math. 91(5): 863-871 (2014) - 2013
- [c1]Claude Carlet, Deng Tang, Xiaohu Tang, Qunying Liao:
New Construction of Differentially 4-Uniform Bijections. Inscrypt 2013: 22-38 - [p1]Shuhong Gao, Qunying Liao:
Normal bases. Handbook of Finite Fields 2013: 109-116 - 2011
- [j3]Qunying Liao, Lin You:
Low complexity of a class of normal bases over finite fields. Finite Fields Their Appl. 17(1): 1-14 (2011)
2000 – 2009
- 2009
- [j2]Keqin Feng, Qunying Liao, Jing Yang:
Maximal values of generalized algebraic immunity. Des. Codes Cryptogr. 50(2): 243-252 (2009) - [j1]Qunying Liao, Keqin Feng:
On the complexity of the normal bases via prime Gauss period over finite fields. J. Syst. Sci. Complex. 22(3): 395-406 (2009)
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:53 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:
