default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDZiling Heng
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j38]Fengwei Li, Fanhui Meng, Ziling Heng, Qin Yue:
An improvement on Weil bounds for character sums of polynomials over finite fields. Cryptogr. Commun. 16(4): 879-887 (2024)- [j37]Xinran Wang, Ziling Heng
, Fengwei Li, Qin Yue:
LCD codes and almost optimally extendable codes from self-orthogonal codes. Des. Codes Cryptogr. 92(10): 2901-2926 (2024) - [j36]Xiaoru Li, Ziling Heng:
Binary and ternary leading-systematic LCD codes from special functions. Finite Fields Their Appl. 97: 102441 (2024) - [j35]Xinran Wang, Ziling Heng:
Several Families of Self-Orthogonal Codes and Their Applications in Optimal Quantum Codes and LCD Codes. IEEE Trans. Inf. Theory 70(7): 4769-4791 (2024) - [i21]Ziling Heng, Xiaoru Li, Yansheng Wu, Qi Wang:
Two families of linear codes with desirable properties from some functions over finite fields. CoRR abs/2401.01135 (2024) - [i20]Yansheng Wu, Ziling Heng, Chengju Li, Cunsheng Ding:
More MDS codes of non-Reed-Solomon type. CoRR abs/2401.03391 (2024) - [i19]Ziling Heng, Keqing Cao:
The augmented codes of a family of linear codes with locality 2. CoRR abs/2404.18434 (2024) - [i18]Ziling Heng, Mengjie Yang, Yang Ming:
A family of self-orthogonal divisible codes with locality 2. CoRR abs/2404.18437 (2024) - 2023
- [j34]Xiaoru Li, Ziling Heng:
A construction of optimal locally recoverable codes. Cryptogr. Commun. 15(3): 553-563 (2023) - [j33]Ziling Heng, Dexiang Li, Fenjin Liu:
Ternary self-orthogonal codes from weakly regular bent functions and their application in LCD Codes. Des. Codes Cryptogr. 91(12): 3953-3976 (2023) - [j32]Ziling Heng, Xinran Wang:
New infinite families of near MDS codes holding t-designs. Discret. Math. 346(10): 113538 (2023) - [j31]Dexiang Li, Ziling Heng, Chengju Li:
Three families of self-orthogonal codes and their application in optimal quantum codes. Discret. Math. 346(12): 113626 (2023) - [j30]Xiaoru Li, Ziling Heng:
Constructions of near MDS codes which are optimal locally recoverable codes. Finite Fields Their Appl. 88: 102184 (2023) - [j29]Ziling Heng, Xinran Wang, Xiaoru Li:
Constructions of cyclic codes and extended primitive cyclic codes with their applications. Finite Fields Their Appl. 89: 102208 (2023) - [j28]Ziling Heng:
Projective Linear Codes From Some Almost Difference Sets. IEEE Trans. Inf. Theory 69(2): 978-994 (2023) - [i17]Xiaoru Li, Ziling Heng:
Self-orthogonal codes from p-divisible codes. CoRR abs/2311.11634 (2023) - 2022
- [j27]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) - [j26]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) - [j25]Ziling Heng, Fuling Chen, Chunlei Xie, Dexiang Li:
Constructions of projective linear codes by the intersection and difference of sets. Finite Fields Their Appl. 83: 102092 (2022) - [j24]Ziling Heng, Cunsheng Ding:
The Subfield Codes of Some [q + 1, 2, q] MDS Codes. IEEE Trans. Inf. Theory 68(6): 3643-3656 (2022) - [j23]Ziling Heng, Chengju Li, Xinran Wang:
Constructions of MDS, Near MDS and Almost MDS Codes From Cyclic Subgroups of F*q2. IEEE Trans. Inf. Theory 68(12): 7817-7831 (2022) - [c1]Ziling Heng, Xiaoru Li:
Near MDS Codes with Dimension 4 and Their Application in Locally Recoverable Codes. WAIFI 2022: 142-158 - [i16]Xiaoru Li, Ziling Heng:
Constructions of near MDS codes which are optimal locally recoverable codes. CoRR abs/2204.11208 (2022) - [i15]Xiaoru Li, Ziling Heng:
A construction of optimal locally recoverable codes. CoRR abs/2204.12034 (2022) - [i14]Ziling Heng, Xinran Wang, Xiaoru Li:
Constructions of cyclic codes and extended primitive cyclic codes with their applications. CoRR abs/2210.05170 (2022) - [i13]Ziling Heng, Xinran Wang:
New infinite families of near MDS codes holding $t$-designs and optimal locally recoverable codes. CoRR abs/2210.05194 (2022) - 2021
- [j22]Ziling Heng, Weiqiong Wang, Yan Wang:
Projective binary linear codes from special Boolean functions. Appl. Algebra Eng. Commun. Comput. 32(4): 521-552 (2021) - [j21]Ziling Heng, Dexiang Li, Jiao Du, Fuling Chen:
A family of projective two-weight linear codes. Des. Codes Cryptogr. 89(8): 1993-2007 (2021) - [j20]Qiuyan Wang, Ziling Heng:
Near MDS codes from oval polynomials. Discret. Math. 344(4): 112277 (2021) - [i12]Ziling Heng, Dexiang Li, Jiao Du, Fuling Chen:
A family of projective two-weight linear codes. CoRR abs/2103.13633 (2021) - [i11]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
- [j19]Ziling Heng, Cunsheng Ding, Weiqiong Wang:
Optimal Binary Linear Codes From Maximal Arcs. IEEE Trans. Inf. Theory 66(9): 5387-5394 (2020) - [j18]Ziling Heng, Qiuyan Wang, Cunsheng Ding:
Two Families of Optimal Linear Codes and Their Subfield Codes. IEEE Trans. Inf. Theory 66(11): 6872-6883 (2020) - [i10]Ziling Heng, Cunsheng Ding, Weiqiong Wang:
Optimal Binary Linear Codes from Maximal Arcs. CoRR abs/2001.01049 (2020) - [i9]Qiuyan Wang, Ziling Heng:
Near MDS codes from oval polynomials. CoRR abs/2008.00663 (2020) - [i8]Ziling Heng, Cunsheng Ding:
The Subfield Codes of [q+1, 2, q] MDS Codes. CoRR abs/2008.00695 (2020)
2010 – 2019
- 2019
- [j17]Ziling Heng, Cunsheng Ding:
A construction of q-ary linear codes with irreducible cyclic codes. Des. Codes Cryptogr. 87(5): 1087-1108 (2019) - [j16]Ziling Heng, Cunsheng Ding:
The subfield codes of hyperoval and conic codes. Finite Fields Their Appl. 56: 308-331 (2019) - [j15]Cunsheng Ding, Ziling Heng:
The Subfield Codes of Ovoid Codes. IEEE Trans. Inf. Theory 65(8): 4715-4729 (2019) - 2018
- [j14]Ziling Heng:
Nearly optimal codebooks based on generalized Jacobi sums. Discret. Appl. Math. 250: 227-240 (2018) - [j13]Ziling Heng, Cunsheng Ding, Zhengchun Zhou:
Minimal linear codes over finite fields. Finite Fields Their Appl. 54: 176-196 (2018) - [j12]Cunsheng Ding, Ziling Heng, Zhengchun Zhou:
Minimal Binary Linear Codes. IEEE Trans. Inf. Theory 64(10): 6536-6545 (2018) - [i7]Ziling Heng, Cunsheng Ding, Zhengchun Zhou:
Minimal Linear Codes over Finite Fields. CoRR abs/1803.09988 (2018) - [i6]Cunsheng Ding, Ziling Heng:
The Subfield Codes of Ovoid Codes. CoRR abs/1804.05516 (2018) - [i5]Ziling Heng, Cunsheng Ding:
The Subfield Codes of Hyperoval and Conic codes. CoRR abs/1804.06003 (2018) - 2017
- [j11]Ziling Heng, Qin Yue:
Optimal codebooks achieving the Levenshtein bound from generalized bent functions over ℤ 4 Z4. Cryptogr. Commun. 9(1): 41-53 (2017) - [j10]Ziling Heng, Qin Yue:
Complete weight distributions of two classes of cyclic codes. Cryptogr. Commun. 9(3): 323-343 (2017) - [j9]Ziling Heng, Qin Yue:
Evaluation of the Hamming weights of a class of linear codes based on Gauss sums. Des. Codes Cryptogr. 83(2): 307-326 (2017) - [j8]Ziling Heng, Qin Yue:
A construction of q-ary linear codes with two weights. Finite Fields Their Appl. 48: 20-42 (2017) - [j7]Ziling Heng, Cunsheng Ding, Qin Yue:
New Constructions of Asymptotically Optimal Codebooks With Multiplicative Characters. IEEE Trans. Inf. Theory 63(10): 6179-6187 (2017) - [i4]Ziling Heng:
Asymptotically optimal codebooks based on generalized Jacobi sums. CoRR abs/1705.08055 (2017) - 2016
- [j6]Ziling Heng, Qin Yue, Chengju Li:
Three classes of linear codes with two or three weights. Discret. Math. 339(11): 2832-2847 (2016) - [j5]Ziling Heng, Qin Yue:
Two classes of two-weight linear codes. Finite Fields Their Appl. 38: 72-92 (2016) - [j4]Ziling Heng, Qin Yue:
Several Classes of Cyclic Codes With Either Optimal Three Weights or a Few Weights. IEEE Trans. Inf. Theory 62(8): 4501-4513 (2016) - [i3]Ziling Heng, Qin Yue:
Optimal linear codes, constant-weight codes and constant-composition codes over $\Bbb F_{q}$. CoRR abs/1605.04063 (2016) - 2015
- [j3]Chengju Li, Qin Yue, Ziling Heng:
Weight distributions of a class of cyclic codes from Fl-conjugates. Adv. Math. Commun. 9(3): 341-352 (2015) - [j2]Ziling Heng, Qin Yue:
Generalized Gray map and a class of p-ary nonlinear codes. Finite Fields Their Appl. 36: 81-97 (2015) - [j1]Ziling Heng, Qin Yue:
A Class of Binary Linear Codes With at Most Three Weights. IEEE Commun. Lett. 19(9): 1488-1491 (2015) - [i2]Ziling Heng, Qin Yue:
Several classes of cyclic codes with either optimal three weights or a few weights. CoRR abs/1510.05355 (2015) - [i1]Ziling Heng, Qin Yue:
Evaluation of the weight distribution of a class of linear codes based on semi-primitive Gauss sums. CoRR abs/1511.02093 (2015)
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-23 21:26 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:
