default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLiqin Qian
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j23]Xiangdong Cheng, Xiwang Cao, Liqin Qian:
Linear complementary dual codes and double circulant codes over a semi-local ring. Adv. Math. Commun. 18(4): 1010-1021 (2024)- [j22]Liqin Qian, Xiwang Cao, Xia Wu, Wei Lu:
MDS codes with l-Galois hulls of arbitrary dimensions. Des. Codes Cryptogr. 92(7): 1879-1902 (2024) - [j21]Liqin Qian, Xiwang Cao
, Jerod Michel:
Constructions of strongly regular Cayley graphs derived from weakly regular bent functions. Discret. Math. 347(5): 113916 (2024) - [j20]Liqin Qian, Minjia Shi, Wei Lu, Xiwang Cao:
A new method for solving the equation x + (x+1) = b in Fq4 where d = q3 + q2 + q - 1. Discret. Math. 347(7): 114025 (2024) - [j19]Xiangdong Cheng, Xiwang Cao, Liqin Qian:
Linear Codes and Linear Complementary Pairs of Codes Over a Non-Chain Ring. Int. J. Found. Comput. Sci. 35(3): 297-311 (2024) - 2023
- [j18]Liqin Qian, Xiwang Cao:
Gaussian sums, hyper Eisenstein sums and Jacobi sums over a local ring and their applications. Appl. Algebra Eng. Commun. Comput. 34(2): 211-244 (2023) - [j17]Liqin Qian, Xiwang Cao:
Character sums over a non-chain ring and their applications. Adv. Math. Commun. 17(2): 381-403 (2023) - [j16]Minjia Shi, Liqin Qian, Tor Helleseth, Patrick Solé:
Five-weight codes from three-valued correlation of M-sequences. Adv. Math. Commun. 17(4): 799-814 (2023) - [j15]Sihem Mesnager, Liqin Qian, Xiwang Cao:
Further projective binary linear codes derived from two-to-one functions and their duals. Des. Codes Cryptogr. 91(3): 719-746 (2023) - [j14]Sihem Mesnager, Liqin Qian, Xiwang Cao:
Two families of few-weight codes over a finite chain ring. Discret. Math. 346(7): 113464 (2023) - [j13]Sihem Mesnager, Liqin Qian, Xiwang Cao, Mu Yuan:
Several Families of Binary Minimal Linear Codes From Two-to-One Functions. IEEE Trans. Inf. Theory 69(5): 3285-3301 (2023) - [i7]Liqin Qian, Minjia Shi, Wei Lu:
A new method for solving the equation xd+(x+1)d=b in Fq4 where d=q3+q2+q-1. CoRR abs/2305.10671 (2023) - 2022
- [j12]Liqin Qian, Xiwang Cao, Wei Lu, Patrick Solé:
A new method for constructing linear codes with small hulls. Des. Codes Cryptogr. 90(11): 2663-2682 (2022) - [j11]Xiangdong Cheng, Xiwang Cao, Liqin Qian:
Constructing few-weight linear codes and strongly regular graphs. Discret. Math. 345(12): 113101 (2022) - [j10]Liqin Qian, Xiwang Cao:
Several new constructions of mutually unbiased bases derived from functions over finite fields. Quantum Inf. Process. 21(8): 296 (2022) - 2021
- [j9]Liqin Qian, Xiwang Cao, Sihem Mesnager:
Linear codes with one-dimensional hull associated with Gaussian sums. Cryptogr. Commun. 13(2): 225-243 (2021) - [i6]Liqin Qian, Xiwang Cao, Wei Lu, Patrick Solé:
A new method for constructing linear codes with small hulls. CoRR abs/2103.10874 (2021) - 2020
- [j8]Minjia Shi, Hongwei Zhu, Liqin Qian, Lin Sok, Patrick Solé:
On self-dual and LCD double circulant and double negacirculant codes over $\mathbb {F}_{q}+u\mathbb {F}_{q}$. Cryptogr. Commun. 12(1): 53-70 (2020) - [j7]Liqin Qian, Xiwang Cao:
Bounds and Optimal $q$ -Ary Codes Derived From the $\mathbb{Z}_qR$ -Cyclic Codes. IEEE Trans. Inf. Theory 66(2): 923-935 (2020)
2010 – 2019
- 2019
- [j6]Liqin Qian, Minjia Shi, Patrick Solé:
On self-dual and LCD quasi-twisted codes of index two over a special chain ring. Cryptogr. Commun. 11(4): 717-734 (2019) - [i5]Liqin Qian, Xiwang Cao, Wei Lu, Xia Wu:
New constructions of asymptotically optimal codebooks via character sums over a local ring. CoRR abs/1906.05523 (2019) - 2018
- [j5]Minjia Shi, Liqin Qian, Patrick Solé:
Few-weight codes from trace codes over a local ring. Appl. Algebra Eng. Commun. Comput. 29(4): 335-350 (2018) - [j4]Minjia Shi, Liqin Qian, Patrick Solé:
On self-dual negacirculant codes of index two and four. Des. Codes Cryptogr. 86(11): 2485-2494 (2018) - [j3]Minjia Shi, Hongwei Zhu, Liqin Qian, Patrick Solé:
On Self-Dual Four Circulant Codes. Int. J. Found. Comput. Sci. 29(7): 1143-1150 (2018) - [i4]Minjia Shi, Liqin Qian, Patrick Solé:
Linear codes with few weights over F2+uF2. CoRR abs/1802.09919 (2018) - [i3]Minjia Shi, Hongwei Zhu, Liqin Qian, Lin Sok, Patrick Solé:
On self-dual and LCD double circulant and double negacirculant codes over Fq + uFq. CoRR abs/1806.02951 (2018) - 2017
- [j2]Minjia Shi, Liqin Qian, Lin Sok, Nuh Aydin, Patrick Solé:
On constacyclic codes over Z4[u]/〈u2-1〉 and their Gray images. Finite Fields Their Appl. 45: 86-95 (2017) - [j1]Minjia Shi, Liqin Qian, Yan Liu, Patrick Solé:
Good self-dual generalized quasi-cyclic codes exist. Inf. Process. Lett. 118: 21-24 (2017) - [i2]Minjia Shi, Liqin Qian, Patrick Solé:
On self-dual negacirculant codes of index two and four. CoRR abs/1709.07546 (2017) - 2016
- [i1]Minjia Shi, Liqin Qian, Patrick Solé:
New few weight codes from trace codes over a local Ring. CoRR abs/1612.04515 (2016)
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-07-09 22:03 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:
