Xiangyong Zeng
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Xiangyong Zeng has a total of 168 co-authors. Here are the top co-authors by number of shared publications:
- Nian Li
Hubei Provincial Engineering Research Center of Intelligent Connected Vehicle Network Security, School of Cyber Science and Technology, Hubei University, Wuhan, China
46 shared publications - Chunlei Li
Department of Informatics, University of Bergen, Bergen, Norway
24 shared publications - Zejun Xiang
School of Cyber Science and Technology, Hubei University, Wuhan, China
21 shared publications - Lei Hu
Chinese Academy of Sciences
19 shared publications - Shasha Zhang
Hubei University
15 shared publications - Xiaohu Tang
Southwest Jiaotong University
13 shared publications
Latest Publications
- 1 November 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Consumer Electronics
- Vol. 72 (4) , 9692-9704
Identity-Based Multimodal Private Signatures and Their Applications in Anonymous Reputation Systems
- 1 November 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Consumer Electronics
- Vol. 72 (4) , 9692-9704
Identity-Based Multimodal Private Signatures and Their Applications in Anonymous Reputation Systems
- 10 September 2026
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 94 (9) , 199
Infinite families of constacyclic codes supporting 3-designs
- 10 September 2026
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 94 (9) , 199
Infinite families of constacyclic codes supporting 3-designs
- 3 August 2026
- Published by Elsevier in Discrete Mathematics
- Vol. 350 (1)
A new approach for constructing (vectorial) bent functions with Dillon-type exponents
- 3 August 2026
- Published by Elsevier in Discrete Mathematics
- Vol. 350 (1)
A new approach for constructing (vectorial) bent functions with Dillon-type exponents
- 27 June 2026
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 94 (7) , 145
Cryptanalysis of Gleeok-128
- 27 June 2026
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 94 (7) , 145
Cryptanalysis of Gleeok-128
- 5 June 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. PP (00189448) , 1
On the Construction and Correlation Properties of Permutation-Interleaved Zadoff-Chu Sequences
Constant amplitude zero auto-correlation (CAZAC) sequences are widely applied in waveforms for radar and communication systems. Motivated by a recent work [Berggren and Popovi´c, IEEE Trans. Inf. Theory 70(8), 6068-6075 (2024)], this paper advances the approach to generating CAZAC sequences by interleaving Zadoff-Chu (ZC) sequences with permutation polynomials (PPs). We propose one class of high-degree PPs over the integer ring ZN, and utilize them and their inverses to interleave ZC sequences for constructing CAZAC sequences. It is known that a CAZAC sequence can be extended to an equivalence class by five basic operations. We further show that the obtained CAZAC sequences are not covered by the equivalence classes of ZC sequences and interleaved ZC sequences by quadratic PPs and their inverses, and prove the sufficiency of the conjecture by Berggren and Popovi´c in the aforementioned work. In addition, we also evaluate the aperiodic auto-correlation of certain ZC sequences interleaved by quadratic PPs.
- 5 June 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. PP (00189448) , 1
On the Construction and Correlation Properties of Permutation-Interleaved Zadoff-Chu Sequences
Constant amplitude zero auto-correlation (CAZAC) sequences are widely applied in waveforms for radar and communication systems. Motivated by a recent work [Berggren and Popovi´c, IEEE Trans. Inf. Theory 70(8), 6068-6075 (2024)], this paper advances the approach to generating CAZAC sequences by interleaving Zadoff-Chu (ZC) sequences with permutation polynomials (PPs). We propose one class of high-degree PPs over the integer ring ZN, and utilize them and their inverses to interleave ZC sequences for constructing CAZAC sequences. It is known that a CAZAC sequence can be extended to an equivalence class by five basic operations. We further show that the obtained CAZAC sequences are not covered by the equivalence classes of ZC sequences and interleaved ZC sequences by quadratic PPs and their inverses, and prove the sufficiency of the conjecture by Berggren and Popovi´c in the aforementioned work. In addition, we also evaluate the aperiodic auto-correlation of certain ZC sequences interleaved by quadratic PPs.
- 20 May 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. PP (00189448) , 1
The structure and enumeration of periodic binary sequences with high nonlinear complexity
Nonlinear complexity, as an important measure for assessing the randomness of sequences, is defined as the minimal length of feedback shift registers that can generate a given sequence. This paper establishes the structure of n-periodic binary sequences with nonlinear complexity larger than or equal to b [3n/4] Based on their structure, an exact enumeration formula for the number of such periodic sequences is determined.
- 20 May 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. PP (00189448) , 1
The structure and enumeration of periodic binary sequences with high nonlinear complexity
Nonlinear complexity, as an important measure for assessing the randomness of sequences, is defined as the minimal length of feedback shift registers that can generate a given sequence. This paper establishes the structure of n-periodic binary sequences with nonlinear complexity larger than or equal to b [3n/4] Based on their structure, an exact enumeration formula for the number of such periodic sequences is determined.
- 7 May 2026
- Published by Elsevier in Finite Fields and Their Applications
- Vol. 114
Several classes of optimal linear codes with few weights from simplicial complexes
- 7 May 2026
- Published by Elsevier in Finite Fields and Their Applications
- Vol. 114
Several classes of optimal linear codes with few weights from simplicial complexes
- 2 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 72 (5) , 2823-2840
Infinite Families of Optimal Codes Over Non-Unital Non-Commutative Rings From Simplicial Complexes
In this paper, several infinite families of codes over the extension of non-unital non-commutative rings are constructed utilizing general simplicial complexes. Thanks to the special structure of the defining sets, the principal parameters of these codes are characterized. Specially, when the employed simplicial complexes are generated by a single maximal element, we determine their Lee weight distributions completely. Furthermore, by considering the Gray image codes and the corresponding subfield-like codes, numerous of linear codes over $\mathbb {F}_{q}$ are also obtained, where $q$ is a prime power. Certain conditions are given to ensure the above linear codes are (Hermitian) self-orthogonal in the case of $q=2,3,4$ . It is noteworthy that most of the derived codes over $\mathbb {F}_{q}$ satisfy the Ashikhmin-Barg’s condition for minimality. Besides, we obtain two infinite families of distance-optimal codes over $\mathbb {F}_{q}$ with respect to the Griesmer bound. By puncturing the Gray image codes and subfield-like codes, several classes of projective codes are presented.
- 2 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 72 (5) , 2823-2840
Infinite Families of Optimal Codes Over Non-Unital Non-Commutative Rings From Simplicial Complexes
In this paper, several infinite families of codes over the extension of non-unital non-commutative rings are constructed utilizing general simplicial complexes. Thanks to the special structure of the defining sets, the principal parameters of these codes are characterized. Specially, when the employed simplicial complexes are generated by a single maximal element, we determine their Lee weight distributions completely. Furthermore, by considering the Gray image codes and the corresponding subfield-like codes, numerous of linear codes over $\mathbb {F}_{q}$ are also obtained, where $q$ is a prime power. Certain conditions are given to ensure the above linear codes are (Hermitian) self-orthogonal in the case of $q=2,3,4$ . It is noteworthy that most of the derived codes over $\mathbb {F}_{q}$ satisfy the Ashikhmin-Barg’s condition for minimality. Besides, we obtain two infinite families of distance-optimal codes over $\mathbb {F}_{q}$ with respect to the Griesmer bound. By puncturing the Gray image codes and subfield-like codes, several classes of projective codes are presented.
- Open Access
The structure and enumeration of periodic binary sequences with high nonlinear complexity
Nonlinear complexity, as an important measure for assessing the randomness of sequences, is defined as the length of the shortest feedback shift registers that can generate a given sequence. In this paper, the structure of n-periodic binary sequences with nonlinear complexity larger than or equal to 3n/4 is characterized. Based on their structure, an exact enumeration formula for the number of such periodic sequences is determined.
Open AccessThe structure and enumeration of periodic binary sequences with high nonlinear complexity
Nonlinear complexity, as an important measure for assessing the randomness of sequences, is defined as the length of the shortest feedback shift registers that can generate a given sequence. In this paper, the structure of n-periodic binary sequences with nonlinear complexity larger than or equal to 3n/4 is characterized. Based on their structure, an exact enumeration formula for the number of such periodic sequences is determined.
- Open Access
On the Construction and Correlation Properties of Permutation-Interleaved Zadoff-Chu Sequences
Constant amplitude zero auto-correlation (CAZAC) sequences are widely applied in waveforms for radar and communication systems. Motivated by a recent work [Berggren and Popović, IEEE Trans. Inf. Theory 70(8), 6068-6075 (2024)], this paper further investigates the approach to generating CAZAC sequences by interleaving Zadoff-Chu (ZC) sequences with permutation polynomials (PPs). We propose one class of high-degree PPs over the integer ring Z N , and utilize them and their inverses to interleave ZC sequences for constructing CAZAC sequences. It is known that a CAZAC sequence can be extended to an equivalence class by five basic opertations. We further show that the obtained CAZAC sequences are not covered by the equivalence classes of ZC sequences and interleaved ZC sequences by quadratic PPs and their inverses, and prove the sufficiency of the conjecture by Berggren and Popović in the aforementioned work. In addition, we also evaluate the aperiodic auto-correlation of certain ZC sequences from quadratic PPs.
Open AccessOn the Construction and Correlation Properties of Permutation-Interleaved Zadoff-Chu Sequences
Constant amplitude zero auto-correlation (CAZAC) sequences are widely applied in waveforms for radar and communication systems. Motivated by a recent work [Berggren and Popović, IEEE Trans. Inf. Theory 70(8), 6068-6075 (2024)], this paper further investigates the approach to generating CAZAC sequences by interleaving Zadoff-Chu (ZC) sequences with permutation polynomials (PPs). We propose one class of high-degree PPs over the integer ring Z N , and utilize them and their inverses to interleave ZC sequences for constructing CAZAC sequences. It is known that a CAZAC sequence can be extended to an equivalence class by five basic opertations. We further show that the obtained CAZAC sequences are not covered by the equivalence classes of ZC sequences and interleaved ZC sequences by quadratic PPs and their inverses, and prove the sufficiency of the conjecture by Berggren and Popović in the aforementioned work. In addition, we also evaluate the aperiodic auto-correlation of certain ZC sequences from quadratic PPs.