Zhiwen He
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
Zhiwen He has a total of 19 co-authors. Here are the top co-authors by number of shared publications:
- Gennian Ge
Capital Normal University
3 shared publications - Tingting Chen
Institute of Mathematics and Interdisciplinary Sciences, Xidian University, Xi’an, China
3 shared publications Wendi Di
3 shared publicationsTao Feng
School of Mathematical Sciences, Zhejiang University, Hangzhou 310027, P. R. China
2 shared publicationsChao Li
Center for Space Computing, Zhejiang Lab
1 shared publication- Erzhong Xue
Center for Space Computing, Zhejiang Lab
1 shared publication
Latest Publications
- 9 May 2025
- Published by Springer Nature in Journal of Algebraic Combinatorics
- Vol. 61 (3) , 1-25
On central partial difference sets in non-abelian p-groups
- 9 May 2025
- Published by Springer Nature in Journal of Algebraic Combinatorics
- Vol. 61 (3) , 1-25
On central partial difference sets in non-abelian p-groups
- 1 January 2025
- Published by American Association for the Advancement of Science (AAAS) in Intelligent Computing
- Vol. 4
Space Computing: Architectures, Challenges, and Future Directions
In recent years, the rapid advancement of space technologies has given rise to sophisticated space computing systems, which have become crucial for various applications such as Earth observation, communication, and scientific research. This survey paper provides a comprehensive overview of the history, current state, and future trends in space computing systems. We discuss the evolution of these systems, highlighting important milestones from early satellite communication networks to modern space–air–ground integrated networks (SAGIN). Despite their advancements, space computing systems face numerous challenges, including resource constraints and unstable network links. To address these challenges, we explore key enabling technologies that are critical for the future of space computing. These include virtualization and resource pooling, which enhance resource utilization; distributed storage, which provides resilience and efficiency; advanced scheduling and orchestration techniques, which optimize task allocation across heterogeneous resources; collaborative AI training and inference, which leverage distributed satellite networks for real-time data processing; and robust security and privacy measures, which are vital for safeguarding sensitive information in space operations. By examining existing systems and identifying open research challenges, this paper aims to provide a road map for future research and development in the field of space computing systems. Our findings highlight the potential of emerging technologies to transform space operations and underscore the importance of continued innovation in overcoming current limitations.
- 1 January 2025
- Published by American Association for the Advancement of Science (AAAS) in Intelligent Computing
- Vol. 4
Space Computing: Architectures, Challenges, and Future Directions
In recent years, the rapid advancement of space technologies has given rise to sophisticated space computing systems, which have become crucial for various applications such as Earth observation, communication, and scientific research. This survey paper provides a comprehensive overview of the history, current state, and future trends in space computing systems. We discuss the evolution of these systems, highlighting important milestones from early satellite communication networks to modern space–air–ground integrated networks (SAGIN). Despite their advancements, space computing systems face numerous challenges, including resource constraints and unstable network links. To address these challenges, we explore key enabling technologies that are critical for the future of space computing. These include virtualization and resource pooling, which enhance resource utilization; distributed storage, which provides resilience and efficiency; advanced scheduling and orchestration techniques, which optimize task allocation across heterogeneous resources; collaborative AI training and inference, which leverage distributed satellite networks for real-time data processing; and robust security and privacy measures, which are vital for safeguarding sensitive information in space operations. By examining existing systems and identifying open research challenges, this paper aims to provide a road map for future research and development in the field of space computing systems. Our findings highlight the potential of emerging technologies to transform space operations and underscore the importance of continued innovation in overcoming current limitations.
- 10 April 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 70 (7) , 4928-4945
Constant L₁-Weight Codes Under L∞-Metric
This paper studies the construction of constant L 1 -weight codes under L ∞ -metric, which could be used to design codes addressing 0-indels (i.e., the insertion/deletion of 0’s only). Based on the patterns of small codes, we determine the maximum size for codes with distance 2 and length 3 for any constant weight, and several constructions and algorithms for suboptimal codes with general length w +1 are also provided. In general, for codes with distance D , length w +1, and weight tD + r , we derive the size of the largest code by using Hall’s theorem for integers r = 0, t ∈ [0, 3] and w ≥ t -1. When r = D /2 with D being even, codes with a cardinality that surpasses the known existing sizes by the additive term ⌈1/3 ( t+1 2 )⌉ ⌊ w +1/3⌋ are constructed based on the structure of group divisible designs in combinatorics.
- 10 April 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 70 (7) , 4928-4945
Constant L₁-Weight Codes Under L∞-Metric
This paper studies the construction of constant L 1 -weight codes under L ∞ -metric, which could be used to design codes addressing 0-indels (i.e., the insertion/deletion of 0’s only). Based on the patterns of small codes, we determine the maximum size for codes with distance 2 and length 3 for any constant weight, and several constructions and algorithms for suboptimal codes with general length w +1 are also provided. In general, for codes with distance D , length w +1, and weight tD + r , we derive the size of the largest code by using Hall’s theorem for integers r = 0, t ∈ [0, 3] and w ≥ t -1. When r = D /2 with D being even, codes with a cardinality that surpasses the known existing sizes by the additive term ⌈1/3 ( t+1 2 )⌉ ⌊ w +1/3⌋ are constructed based on the structure of group divisible designs in combinatorics.
- 10 April 2024
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 92 (8) , 2323-2340
New constructions of signed difference sets
- 10 April 2024
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 92 (8) , 2323-2340
New constructions of signed difference sets
- Open Access
New constructions of signed difference sets
Signed difference sets have interesting applications in communications and coding theory. A $(v,k,λ)$-difference set in a finite group $G$ of order $v$ is a subset $D$ of $G$ with $k$ distinct elements such that the expressions $xy^{-1}$ for all distinct two elements $x,y\in D$, represent each non-identity element in $G$ exactly $λ$ times. A $(v,k,λ)$-signed difference set is a generalization of a $(v,k,λ)$-difference set $D$, which satisfies all properties of $D$, but has a sign for each element in $D$. We will show some new existence results for signed difference sets by using partial difference sets, product methods, and cyclotomic classes.Open AccessNew constructions of signed difference sets
Signed difference sets have interesting applications in communications and coding theory. A $(v,k,λ)$-difference set in a finite group $G$ of order $v$ is a subset $D$ of $G$ with $k$ distinct elements such that the expressions $xy^{-1}$ for all distinct two elements $x,y\in D$, represent each non-identity element in $G$ exactly $λ$ times. A $(v,k,λ)$-signed difference set is a generalization of a $(v,k,λ)$-difference set $D$, which satisfies all properties of $D$, but has a sign for each element in $D$. We will show some new existence results for signed difference sets by using partial difference sets, product methods, and cyclotomic classes. - Open Access
On the irreducible characters of Suzuki p-groups
In this paper, we completely determine the irreducible characters of the four families of Suzuki $p$-groups.
Open AccessOn the irreducible characters of Suzuki p-groups
In this paper, we completely determine the irreducible characters of the four families of Suzuki $p$-groups.
- 20 October 2022
- Published by World Scientific Pub Co Pte Ltd in Journal of Algebra and Its Applications
- Vol. 23 (01)
On the irreducible characters of Suzuki p-groups
- 20 October 2022
- Published by World Scientific Pub Co Pte Ltd in Journal of Algebra and Its Applications
- Vol. 23 (01)
On the irreducible characters of Suzuki p-groups
- Open AccessOn central difference sets in Suzuki $p$-groups of type $A$In this paper, when the order of $\theta$ is even, we prove that there exists no central difference sets in $A_2(m,\theta)$ and establish some non-existence results of central partial difference sets in $A_p(m,\theta)$ with $p>2$. When the order of $\theta$ is odd, we construct central difference sets in $A_2(m,\theta)$. Furthermore, we give some reduced linking systems of difference sets in $A_2(m,\theta)$ by using the difference sets we constructed. In the case $p>2$, we construct Latin square type central partial difference sets in $A_p(m,\theta)$ by a similar method.Open AccessOn central difference sets in Suzuki $p$-groups of type $A$In this paper, when the order of $\theta$ is even, we prove that there exists no central difference sets in $A_2(m,\theta)$ and establish some non-existence results of central partial difference sets in $A_p(m,\theta)$ with $p>2$. When the order of $\theta$ is odd, we construct central difference sets in $A_2(m,\theta)$. Furthermore, we give some reduced linking systems of difference sets in $A_2(m,\theta)$ by using the difference sets we constructed. In the case $p>2$, we construct Latin square type central partial difference sets in $A_p(m,\theta)$ by a similar method.
- 27 February 2021
- Published by Springer Nature in Cryptography and Communications
- Vol. 13 (3) , 407-423
Linear codes of 2-designs as subcodes of the generalized Reed-Muller codes
- 27 February 2021
- Published by Springer Nature in Cryptography and Communications
- Vol. 13 (3) , 407-423
Linear codes of 2-designs as subcodes of the generalized Reed-Muller codes
- 10 November 2020
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 89 (2) , 255-268
Two kinds of constructions of directed strongly regular graphs
- 10 November 2020
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 89 (2) , 255-268
Two kinds of constructions of directed strongly regular graphs