default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLina Zhang 0004
Person information
- affiliation: Huizhou University, School of Mathematics and Big Data, China
- affiliation: Anhui University of Science and Technology, College of Science, Department of Mathematics and Physics, Huainan, China
Other persons with the same name
- Lina Zhang (aka: Li-na Zhang, Li-Na Zhang) — disambiguation page
- Lina Zhang 0001
![[0000-0002-2553-2463]](https://dblp.org/img/orcid-mark.12x12.png "0000-0002-2553-2463")
— Shandong University, School of Mechanical, Electrical and Information Engineering, China - Lina Zhang 0002 — Taiyuan University, Department of Intelligence and Information Engineering, China
- Lina Zhang 0003 — Xi'an University of Science and Technology, College of Computer Science and Technology, China (and 1 more)
- Lina Zhang 0005 — Inner Mongolia Normal University, College of Physics and Electronic Information Science, Hohhot, China (and 1 more)
- Lina Zhang 0006 — Nankai University, College of Artificial Intelligence, Institute of Robotics and Automatic Information Systems, Tianjin, China
- Lina Zhang 0007 — City University of Hong Kong, School of creative media, Hong Kong
- Lina Zhang 0008 — Xidian University, School of Mathematics and Statistics, Xi'an, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j9]Jianfa Qian, Lina Zhang:
New Optimal Cyclic Locally Recoverable Codes of Length n=2(q+1). IEEE Trans. Inf. Theory 66(1): 233-239 (2020)
2010 – 2019
- 2019
- [j8]Jianfa Qian, Lina Zhang:
Constructions of new entanglement-assisted quantum MDS and almost MDS codes. Quantum Inf. Process. 18(3): 71 (2019) - [c1]Jianfa Qian, Lina Zhang:
Improved Constructions for Optimal Multi-erasure Locally Recoverable Codes for Big Data Storage. ICBDT 2019: 44-47 - 2018
- [j7]Jianfa Qian, Lina Zhang:
On MDS linear complementary dual codes and entanglement-assisted quantum codes. Des. Codes Cryptogr. 86(7): 1565-1572 (2018) - 2017
- [j6]Jianfa Qian, Lina Zhang:
Improved constructions for quantum maximum distance separable codes. Quantum Inf. Process. 16(1): 20 (2017) - 2015
- [j5]Jianfa Qian, Lina Zhang:
Entanglement-assisted quantum codes from arbitrary binary linear codes. Des. Codes Cryptogr. 77(1): 193-202 (2015) - 2013
- [j4]Jianfa Qian, Lina Zhang:
New optimal subsystem codes. Discret. Math. 313(21): 2451-2455 (2013)
2000 – 2009
- 2006
- [j3]Jianfa Qian, Li-Na Zhang, Shixin Zhu:
(1+u) constacyclic and cyclic codes over F2+uF2. Appl. Math. Lett. 19(8): 820-823 (2006) - [j2]Jianfa Qian, Li-Na Zhang, Shixin Zhu:
Constacyclic and Cyclic Codes over F2 + uF2 + u2F2. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 89-A(6): 1863-1865 (2006) - 2005
- [j1]Jianfa Qian, Li-Na Zhang, Shixin Zhu:
Cyclic Codes over Fp + uFp+ ··· +uk-1 Fp. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 88-A(3): 795-797 (2005)
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-04-27 18:05 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:
