Ziling Heng
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Ziling Heng has a total of 45 co-authors. Here are the top co-authors by number of shared publications:
- Cunsheng Ding
Department of Computer Science and Engineering, The Hong Kong University of Science and Technology, Hong Kong, China
12 shared publications - Chengju Li
MoE Engineering Research Center of Software/Hardware Co-design Technology and Application, East China Normal University, Shanghai, China
9 shared publications - Qin Yue
Nanjing University of Aeronautics and Astronautics
9 shared publications - Weiqiong Wang
Changan Univ, Sch Sci, Xian 710064, Peoples R China
5 shared publications - Xiaoru Li
School of Science, Changan University, Xian, China
5 shared publications - Xinran Wang
School of Science, Changan University, Xian, China
5 shared publications
Latest Publications
- 1 November 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 72 (11) , 8890-8908
Applications of n -to-1 Mappings in Difference Families and Optimal Constant Weight Codes
- 1 November 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 72 (11) , 8890-8908
Applications of n -to-1 Mappings in Difference Families and Optimal Constant Weight Codes
- 12 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 72 (4) , 2528-2542
Hybrid Character Sums From Vectorial Dual-Bent Functions and Asymptotically Optimal Complex Codebooks With Small Alphabet Sizes
Hybrid character sums are an important class of exponential sums which have nice applications in coding theory and sequence design. Let${\mathbb {F}}_{p^{m}}$ be the finite field with$p^{m}$ elements for a prime$p$ and a positive integer$m$ . Let$V_{n}^{(p)}$ be an$n$ -dimensional vector space over${\mathbb {F}}_{p}$ for a prime$p$ . In this paper, we study the hybrid character sums of the form \begin{equation*} \sum _{x \in V_{n}^{(p)}}\psi \left ({{F(x)}}\right)\chi _{a}\left ({{ x}}\right),\end{equation*} where$F$ is a function from$V_{n}^{(p)}$ to${\mathbb {F}}_{p^{m}}$ ,$a \in V_{n}^{(p)}$ ,$\psi $ is a nontrivial multiplicative character of${\mathbb {F}}_{p^{m}}$ ,$\chi _{a}(x)=\zeta _{p}^{\langle a,x\rangle _{n}}$ is the character of$V_{n}^{(p)}$ and$\langle,\rangle _{n}$ denotes a (non-degenerate) inner product of$V_{n}^{(p)}$ . If$F(x)$ is a vectorial dual-bent function and$a \in V_{n}^{(p)}\setminus \{0\}$ , we determine their complex modulus or explicit values under certain conditions. This generalizes some known results as special cases. We show that the hybrid character sums from vectorial dual-bent functions have very small complex modulus. As applications, three families of asymptotically optimal complex codebooks are constructed from vectorial dual-bent functions and their maximal cross-correlation amplitude are determined based on the hybrid character sums. The codebooks we construct have very small alphabet sizes. This enhances their appeal for implementation. Besides, all of the three families of codebooks have only two-valued or three-valued cross-correlation amplitudes.- 12 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 72 (4) , 2528-2542
Hybrid Character Sums From Vectorial Dual-Bent Functions and Asymptotically Optimal Complex Codebooks With Small Alphabet Sizes
Hybrid character sums are an important class of exponential sums which have nice applications in coding theory and sequence design. Let${\mathbb {F}}_{p^{m}}$ be the finite field with$p^{m}$ elements for a prime$p$ and a positive integer$m$ . Let$V_{n}^{(p)}$ be an$n$ -dimensional vector space over${\mathbb {F}}_{p}$ for a prime$p$ . In this paper, we study the hybrid character sums of the form \begin{equation*} \sum _{x \in V_{n}^{(p)}}\psi \left ({{F(x)}}\right)\chi _{a}\left ({{ x}}\right),\end{equation*} where$F$ is a function from$V_{n}^{(p)}$ to${\mathbb {F}}_{p^{m}}$ ,$a \in V_{n}^{(p)}$ ,$\psi $ is a nontrivial multiplicative character of${\mathbb {F}}_{p^{m}}$ ,$\chi _{a}(x)=\zeta _{p}^{\langle a,x\rangle _{n}}$ is the character of$V_{n}^{(p)}$ and$\langle,\rangle _{n}$ denotes a (non-degenerate) inner product of$V_{n}^{(p)}$ . If$F(x)$ is a vectorial dual-bent function and$a \in V_{n}^{(p)}\setminus \{0\}$ , we determine their complex modulus or explicit values under certain conditions. This generalizes some known results as special cases. We show that the hybrid character sums from vectorial dual-bent functions have very small complex modulus. As applications, three families of asymptotically optimal complex codebooks are constructed from vectorial dual-bent functions and their maximal cross-correlation amplitude are determined based on the hybrid character sums. The codebooks we construct have very small alphabet sizes. This enhances their appeal for implementation. Besides, all of the three families of codebooks have only two-valued or three-valued cross-correlation amplitudes.- 18 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 72 (1) , 729-741
Large Sets of Quasi-Complementary Sequences From Polynomials Over Finite Fields and Gaussian Sums
In recent years, quasi-complementary sequence sets (QCSSs) have attracted widespread attention as they can support more users in MC-CDMA communications than perfect complementary sequence sets (PCSSs). The objective of this paper is to present three novel constructions of asymptotically optimal or near-optimal periodic QCSSs based on algebraic methods. Firstly, we propose a generic construction of QCSSs with small alphabet size p from polynomials over finite fields. Using the quadratic and cubic polynomials, we then respectively derive an infinite family of asymptotically optimal QCSSs and an infinite family of asymptotically near-optimal periodic QCSSs with large set sizes. Secondly, we give a construction of periodic QCSSs based on Gaussian sums which have smaller periodic tolerance than that of a known family of QCSSs. Thirdly, we present a construction of periodic QCSSs from permutation polynomials and complementary sets, yielding an infinite family of QCSSs with large set size, small periodic tolerance and low column sequence peak-to-average power ratio (PAPR).
- 18 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 72 (1) , 729-741
Large Sets of Quasi-Complementary Sequences From Polynomials Over Finite Fields and Gaussian Sums
In recent years, quasi-complementary sequence sets (QCSSs) have attracted widespread attention as they can support more users in MC-CDMA communications than perfect complementary sequence sets (PCSSs). The objective of this paper is to present three novel constructions of asymptotically optimal or near-optimal periodic QCSSs based on algebraic methods. Firstly, we propose a generic construction of QCSSs with small alphabet size p from polynomials over finite fields. Using the quadratic and cubic polynomials, we then respectively derive an infinite family of asymptotically optimal QCSSs and an infinite family of asymptotically near-optimal periodic QCSSs with large set sizes. Secondly, we give a construction of periodic QCSSs based on Gaussian sums which have smaller periodic tolerance than that of a known family of QCSSs. Thirdly, we present a construction of periodic QCSSs from permutation polynomials and complementary sets, yielding an infinite family of QCSSs with large set size, small periodic tolerance and low column sequence peak-to-average power ratio (PAPR).
- 11 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 74 (00906778) , 944-956
The Schur Products and Squares of Some Primitive Narrow-Sense BCH Codes
The Schur product as well as square of liner codes have recently drawn increasing attention from scholars as they are important in both coding theory and cryptography. The objective of this paper is to study the parameters of the products and squares of some families of BCH codes, where BCH codes are an interesting type of cyclic codes. Firstly, we determine the fourth largest q-cyclotomic coset leader modulo qm − 1 denoted as Δ4 and then derive the accurate parameters of the corresponding BCH code C(Δ4). Secondly, let C1 and C2 be two primitive narrow-sense BCH codes over Fq with designed distances δa and δb, respectively, where 2 ≤ δa, δb ≤ n. For m ≥ 22 and δa ∈ [q⌊ m+1/2⌋+1 +q⌊m/2⌋−2 +2,q⌊ m+1/2 ⌋+2 +q⌊m/2⌋−3 +1], we give a sufficient and necessary condition for C(δa,δb) ≠ Fnq which is closely related to Δ4, where C(δa,δb) = C1 ⋆ C2 is the Schur product of C1 and C2. Thirdly, when δa = q⌊ m+1/2⌋+2+q⌊m/2 ⌋−3+1 and Δ4 +1 ≤ δb ≤ Δ3 with m ≥ 22, the parameters of C(δa,δb) are studied, where C(δa,δb) is also a primitive narrow-sense BCH code. Fourthly, for a primitive narrow-sense BCH code C with designed distance δ, the parameters of its Schur square C2(δ) are investigated when Δ4+1 ≤ δ ≤ Δ3 for the third largest q-cyclotomic coset leader Δ3 modulo qm − 1. The dimensions of the products and squares of the BCH codes are explicitly determined and lower bounds on their minimum distances are given. Particularly, some codes have good parameters according to the Code Tables at http://www.codetables.de/.
- 11 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 74 (00906778) , 944-956
The Schur Products and Squares of Some Primitive Narrow-Sense BCH Codes
The Schur product as well as square of liner codes have recently drawn increasing attention from scholars as they are important in both coding theory and cryptography. The objective of this paper is to study the parameters of the products and squares of some families of BCH codes, where BCH codes are an interesting type of cyclic codes. Firstly, we determine the fourth largest q-cyclotomic coset leader modulo qm − 1 denoted as Δ4 and then derive the accurate parameters of the corresponding BCH code C(Δ4). Secondly, let C1 and C2 be two primitive narrow-sense BCH codes over Fq with designed distances δa and δb, respectively, where 2 ≤ δa, δb ≤ n. For m ≥ 22 and δa ∈ [q⌊ m+1/2⌋+1 +q⌊m/2⌋−2 +2,q⌊ m+1/2 ⌋+2 +q⌊m/2⌋−3 +1], we give a sufficient and necessary condition for C(δa,δb) ≠ Fnq which is closely related to Δ4, where C(δa,δb) = C1 ⋆ C2 is the Schur product of C1 and C2. Thirdly, when δa = q⌊ m+1/2⌋+2+q⌊m/2 ⌋−3+1 and Δ4 +1 ≤ δb ≤ Δ3 with m ≥ 22, the parameters of C(δa,δb) are studied, where C(δa,δb) is also a primitive narrow-sense BCH code. Fourthly, for a primitive narrow-sense BCH code C with designed distance δ, the parameters of its Schur square C2(δ) are investigated when Δ4+1 ≤ δ ≤ Δ3 for the third largest q-cyclotomic coset leader Δ3 modulo qm − 1. The dimensions of the products and squares of the BCH codes are explicitly determined and lower bounds on their minimum distances are given. Particularly, some codes have good parameters according to the Code Tables at http://www.codetables.de/.
- 1 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Chinese Journal of Electronics
- Vol. 34 (5) , 1483-1496
Self-Orthogonal Codes from Plateaued Functions
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 or plateaued Boolean functions, we construct a family of linear codes with four nonzero weights. This family of linear codes is proved to be not only self-orthogonal but also optimally or almost optimally extendable. Besides, we derive binary and ternary linearly complementary dual codes (LCD codes for short) with new parameters from this family of codes. Some families of self-dual codes are also obtained as byproducts.
- 1 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Chinese Journal of Electronics
- Vol. 34 (5) , 1483-1496
Self-Orthogonal Codes from Plateaued Functions
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 or plateaued Boolean functions, we construct a family of linear codes with four nonzero weights. This family of linear codes is proved to be not only self-orthogonal but also optimally or almost optimally extendable. Besides, we derive binary and ternary linearly complementary dual codes (LCD codes for short) with new parameters from this family of codes. Some families of self-dual codes are also obtained as byproducts.
- 20 August 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 73 (12) , 14167-14182
New Constructions of Asymptotically Optimal Periodic and Aperiodic Quasi-Complementary Sequence Sets
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 complementary sequence sets (PCSSs). The objective of this paper is to present new constructions of asymptotically optimal periodic and aperiodic QCSSs with large set sizes. Firstly, we construct a family of asymptotically optimal periodic (p2n, pn − 1, pn − 1, pn + 1) QCSSs with small alphabet size p, which has larger set size than the known family of periodic (pn(pn−1), pn−1, pn−1, pn+1) QCSSs. Secondly, we construct five new families of asymptotically optimal aperiodic QCSSs with large set sizes and low aperiodic tolerances. Each family of these aperiodic QCSSs has set size Θ(K2) for some flock size K. Compared with known asymptotically optimal aperiodic QCSSs in the literature, our proposed aperiodic QCSSs have better or new parameters. Particularly, for three families of the costructed aperiodic QCSSs, the column sequence peak-to-average power ratio (PAPR) is upper bounded by p if we select suitable column orthogonal complex matrices.
- 20 August 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 73 (12) , 14167-14182
New Constructions of Asymptotically Optimal Periodic and Aperiodic Quasi-Complementary Sequence Sets
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 complementary sequence sets (PCSSs). The objective of this paper is to present new constructions of asymptotically optimal periodic and aperiodic QCSSs with large set sizes. Firstly, we construct a family of asymptotically optimal periodic (p2n, pn − 1, pn − 1, pn + 1) QCSSs with small alphabet size p, which has larger set size than the known family of periodic (pn(pn−1), pn−1, pn−1, pn+1) QCSSs. Secondly, we construct five new families of asymptotically optimal aperiodic QCSSs with large set sizes and low aperiodic tolerances. Each family of these aperiodic QCSSs has set size Θ(K2) for some flock size K. Compared with known asymptotically optimal aperiodic QCSSs in the literature, our proposed aperiodic QCSSs have better or new parameters. Particularly, for three families of the costructed aperiodic QCSSs, the column sequence peak-to-average power ratio (PAPR) is upper bounded by p if we select suitable column orthogonal complex matrices.
- Open Access
Hybrid Character Sums From Vectorial Dual-Bent Functions and Asymptotically Optimal Complex Codebooks With Small Alphabet Sizes
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 $p^m$ elements for a prime $p$ and a positive integer $m$. Let $V_n^{(p)}$ be an $n$-dimensional vector space over $\gf_p$ for a prime $p$. In this paper, we study the hybrid character sums of the form \begin{eqnarray*} \sum_{x \in V_n^{(p)}}ψ\left(F(x)\right)χ_1\left(a x\right), \end{eqnarray*} where $F$ is a function from $V_n^{(p)}$ to $\gf_{p^m}$ and $a \in V_n^{(p)}$, $ψ$ is a nontrivial multiplicative character of $\gf_{p^m}$ and $χ_1$ is the canonical additive character of $V_n^{(p)}$. If $F(x)$ is a vectorial dual-bent function and $a \in V_n^{(p)}\setminus \{0\}$, we determine their complex modulus or explicit values under certain conditions, which generalizes some known results as special cases. It is concluded that the hybrid character sums from vectorial dual-bent functions have very small complex modulus. As applications, three families of asymptotically optimal complex codebooks are constructed from vectorial dual-bent functions and their maximal cross-correlation amplitude are determined based on the hybrid character sums. The constructed codebooks have very small alphabet sizes, which enhances their appeal for implementation. Besides, all of the three families of codebooks have only two-valued or three-valued cross-correlation amplitudes.Open AccessHybrid Character Sums From Vectorial Dual-Bent Functions and Asymptotically Optimal Complex Codebooks With Small Alphabet Sizes
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 $p^m$ elements for a prime $p$ and a positive integer $m$. Let $V_n^{(p)}$ be an $n$-dimensional vector space over $\gf_p$ for a prime $p$. In this paper, we study the hybrid character sums of the form \begin{eqnarray*} \sum_{x \in V_n^{(p)}}ψ\left(F(x)\right)χ_1\left(a x\right), \end{eqnarray*} where $F$ is a function from $V_n^{(p)}$ to $\gf_{p^m}$ and $a \in V_n^{(p)}$, $ψ$ is a nontrivial multiplicative character of $\gf_{p^m}$ and $χ_1$ is the canonical additive character of $V_n^{(p)}$. If $F(x)$ is a vectorial dual-bent function and $a \in V_n^{(p)}\setminus \{0\}$, we determine their complex modulus or explicit values under certain conditions, which generalizes some known results as special cases. It is concluded that the hybrid character sums from vectorial dual-bent functions have very small complex modulus. As applications, three families of asymptotically optimal complex codebooks are constructed from vectorial dual-bent functions and their maximal cross-correlation amplitude are determined based on the hybrid character sums. The constructed codebooks have very small alphabet sizes, which enhances their appeal for implementation. Besides, all of the three families of codebooks have only two-valued or three-valued cross-correlation amplitudes. - 23 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 71 (9) , 6844-6856
New Bounds of Linear Matrix Codes for the Rosenbloom-Tsfasman Metric and Optimal Constructions
The Rosenbloom-Tsfasman metric (RT-metric for short) is a generalization of the Hamming metric. Matrix codes in the frame of the RT-metric have been used in information transmission over parallel channels. In this paper, we develop some new upper bounds on the minimum RT-distance of an $[h \times n, k, d_{\mathrm {RT}}]$ linear matrix code, which generalize the Singleton-type bound derived by Rosenbloom and Tsfasman. It should be emphasized that the upper bounds build a connection between the RT-metric and the Hamming metric. Constructions of linear matrix codes are presented and their parameters for the RT-metric are investigated. It is shown that every linear matrix code can be expressed by using the trace function, which is a generalization of the well-known defining-set construction of linear codes. Moreover, we obtain several classes of optimal linear matrix codes in this paper.
- 23 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 71 (9) , 6844-6856
New Bounds of Linear Matrix Codes for the Rosenbloom-Tsfasman Metric and Optimal Constructions
The Rosenbloom-Tsfasman metric (RT-metric for short) is a generalization of the Hamming metric. Matrix codes in the frame of the RT-metric have been used in information transmission over parallel channels. In this paper, we develop some new upper bounds on the minimum RT-distance of an $[h \times n, k, d_{\mathrm {RT}}]$ linear matrix code, which generalize the Singleton-type bound derived by Rosenbloom and Tsfasman. It should be emphasized that the upper bounds build a connection between the RT-metric and the Hamming metric. Constructions of linear matrix codes are presented and their parameters for the RT-metric are investigated. It is shown that every linear matrix code can be expressed by using the trace function, which is a generalization of the well-known defining-set construction of linear codes. Moreover, we obtain several classes of optimal linear matrix codes in this paper.
- 14 April 2025
- Published by Elsevier in Discrete Mathematics
- Vol. 348 (10)
A family of self-orthogonal divisible codes with locality 2
- 14 April 2025
- Published by Elsevier in Discrete Mathematics
- Vol. 348 (10)
A family of self-orthogonal divisible codes with locality 2