Publications (28)
Nearly optimal codebooks based on generalized Jacobi sums
Ziling Heng
Codebooks with small inner-product correlation are applied in many practical applications including direct spread code division multiple access (CDMA) communications, space-time co…
Linear complexity over and 2-adic complexity of a class of binary generalized cyclotomic sequences with low-value autocorrelation
Yan Wang, Xilin Han, Weiqiong Wang +1
A class of binary sequences with period is constructed using generalized cyclotomic classes, and their linear complexity, minimal polynomial over as well as…
Constructions of near MDS codes which are optimal locally recoverable codes
Xiaoru Li, Ziling Heng
A linear code with parameters is said to be almost maximum distance separable (AMDS for short). An AMDS code whose dual is also AMDS is referred to as an near maximum d…
A family of projective two-weight linear codes
Ziling Heng, Dexiang Li, Jiao Du +1
Projective two-weight linear codes are closely related to finite projective spaces and strongly regular graphs. In this paper, a family of -ary projective two-weight linear code…
The Subfield Codes of MDS Codes
Ziling Heng, Cunsheng Ding
Recently, subfield codes of geometric codes over large finite fields $\gf(q)$ with dimension and were studied and distance-optimal subfield codes over $\gf(p)$ were obtaine…
The Subfield Codes of Ovoid Codes
Cunsheng Ding, Ziling Heng
Ovoids in $\PG(3, \gf(q))$ have been an interesting topic in coding theory, combinatorics, and finite geometry for a long time. So far only two families of ovoids are known. The fi…
The Subfield Codes of Hyperoval and Conic codes
Ziling Heng, Cunsheng Ding
Hyperovals in $\PG(2,\gf(q))$ with even are maximal arcs and an interesting research topic in finite geometries and combinatorics. Hyperovals in $\PG(2,\gf(q))$ are equivalent…
A class of -ary linear codes derived from irreducible cyclic codes
Ziling Heng, Qin Yue
Recently, linear codes with a few weights were widely investigated due to their applications in secret sharing schemes and authentication schemes. In this letter, we present a clas…
Hybrid Character Sums From Vectorial Dual-Bent Functions and Asymptotically Optimal Complex Codebooks With Small Alphabet Sizes
Ziling Heng, Peng Wang, Chengju Li
Hybrid character sums are an important class of exponential sums which have nice applications in coding theory and sequence design. Let $\gf_{p^m}$ be the finite field with e…
Near MDS codes from oval polynomials
Qiuyan Wang, Ziling Heng
A linear code with parameters of the form is referred to as an MDS (maximum distance separable) code. A linear code with parameters of the form is sai…
Large Sets of Quasi-Complementary Sequences From Polynomials over Finite Fields and Gaussian Sums
Ziling Heng, Peng Wang, Chunlei Xie +1
Perfect complementary sequence sets (PCSSs) are widely used in multi-carrier code-division multiple-access (MC-CDMA) communication systems. However, the set size of a PCSS is upper…
More MDS codes of non-Reed-Solomon type
Yansheng Wu, Ziling Heng, Chengju Li +1
MDS codes have diverse practical applications in communication systems, data storage, and quantum codes due to their algebraic properties and optimal error-correcting capability. I…
New infinite families of near MDS codes holding -designs
Ziling Heng, Xinran Wang
In ``Infinite families of near MDS codes holding -designs, IEEE Trans. Inform. Theory, 2020, 66(9), pp. 5419-5428'', Ding and Tang made a breakthrough in constructing the first…
Binary Cyclic Codes With Simultaneously Large Minimum Distances and Dual Distances
Ziling Heng, Jiantao Hu
Binary cyclic codes are an important class of linear codes that admit highly efficient encoding and decoding algorithms. Constructing binary cyclic codes with favorable parameters…
New Criteria and Constructions for Self-Orthogonal Codes
Peng Wang, Ziling Heng
Self-orthogonal codes have attracted considerable attention owing to their applications in quantum error-correcting codes, linear complementary dual codes, and a variety of other f…
Self-orthogonal codes from -divisible codes
Xiaoru Li, Ziling Heng
Self-orthogonal codes are an important subclass of linear codes which have nice applications in quantum codes and lattices. It is known that a binary linear code is self-orthogonal…
Constructions of cyclic codes and extended primitive cyclic codes with their applications
Ziling Heng, Xinran Wang, Xiaoru Li
Linear codes with a few weights have many nice applications including combinatorial design, distributed storage system, secret sharing schemes and so on. In this paper, we construc…
Evaluation of the Hamming weights of a class of linear codes based on Gauss sums
Ziling Heng, Qin Yue
Linear codes with a few weights have been widely investigated in recent years. In this paper, we mainly use Gauss sums to represent the Hamming weights of a class of -ary linear…
Two families of linear codes with desirable properties from some functions over finite fields
Ziling Heng, Xiaoru Li, Yansheng Wu +1
Linear codes are widely studied in coding theory as they have nice applications in distributed storage, combinatorics, lattices, cryptography and so on. Constructing linear codes w…
A family of self-orthogonal divisible codes with locality 2
Ziling Heng, Mengjie Yang, Yang Ming
Linear codes are widely studied due to their applications in communication, cryptography, quantum codes, distributed storage and many other fields. In this paper, we use the trace…
A construction of -ary linear codes with two weights
Ziling Heng, Qin Yue
Linear codes with a few weights are very important in coding theory and have attracted a lot of attention. In this paper, we present a construction of -ary linear codes from tra…
Several classes of cyclic codes with either optimal three weights or a few weights
Ziling Heng, Qin Yue
Cyclic codes with a few weights are very useful in the design of frequency hopping sequences and the development of secret sharing schemes. In this paper, we mainly use Gauss sums…
Self-orthogonal codes from plateaued functions
Peng Wang, Ziling Heng
Self-orthogonal codes are of interest as they have important applications in quantum codes, lattices and many areas. In this paper, based on the weakly regular plateaued functions…
The augmented codes of a family of linear codes with locality 2
Ziling Heng, Keqing Cao
In this paper, we first generalize the class of linear codes by Ding and Ding (IEEE TIT, 61(11), pp. 5835-5842, 2015). Then we mainly study the augmented codes of this generalized…
Minimal Linear Codes over Finite Fields
Ziling Heng, Cunsheng Ding, Zhengchun Zhou
As a special class of linear codes, minimal linear codes have important applications in secret sharing and secure two-party computation. Constructing minimal linear codes with new…
New constructions of asymptotically optimal periodic and aperiodic quasi-complementary sequence sets
Peng Wang, Ziling Heng, Chengju Li
Quasi-complementary sequence sets (QCSSs) play an important role in multi-carrier code division multiple access (MC-CDMA) systems as they can support more users than perfect comple…
A construction of optimal locally recoverable codes
Xiaoru Li, Ziling Heng
Locally recoverable codes are widely used in distributed and cloud storage systems. The objective of this paper is to present a construction of near MDS codes with oval polynomials…
Optimal Binary Linear Codes from Maximal Arcs
Ziling Heng, Cunsheng Ding, Weiqiong Wang
The binary Hamming codes with parameters are perfect. Their extended codes have parameters and are distance-optimal. The first objective o…