Wei Su
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
Wei Su has a total of 17 co-authors. Here are the top co-authors by number of shared publications:
- Cuiling Fan
Southwest Jiaotong University
5 shared publications - Yang Yang
School of Mathematics, Southwest Jiaotong University, Chengdu, China
3 shared publications - Chen Liu
Southwest Jiaotong Univ, Sch Math, Chengdu, Peoples R China
1 shared publication Hui Zhang
School of Mathematics and Statistics, 453007, Henan Normal University, China
1 shared publication- Jianpeng Wang
Southwest Jiaotong University
1 shared publication Jihui Liu
1 shared publication
Latest Publications
- Open Access
- 1 January 2027
- Published by American Institute of Mathematical Sciences (AIMS) in Advances in Mathematics of Communications
- Vol. 26, 125-142
Constructions of cross Z-complementary sets for training design in spatial modulation
Cross Z-complementary sets (CZCSs) play a crucial role in the design of optimal training sequences for broadband spatial modulation (SM) systems over frequency-selective channels. This paper focuses on the construction of $ q $-ary CZCSs to enhance the performance of such systems. Specifically, we propose two novel constructions for $ (4, N_1 + N_2, \min(N_1 + K_2, N_2 + Z_1)) $-CZCSs and $ (4, 2N+1, N+Z) $-CZCSs. The first construction is obtained by concatenating an $ (N_1, Z_1) $ cross Z-complementary sequence pair (CZCP) that is also a quaternary Golay complementary pair (QGCP) with a QGCP of length $ N_2 $ satisfying an additional correlation constraint, whereas the second construction is developed from $ q $-ary Golay complementary pairs of length $ N $. These results provide flexible parameter choices for practical applications in broadband spatial modulation systems.- 1 January 2027
- Published by American Institute of Mathematical Sciences (AIMS) in Advances in Mathematics of Communications
- Vol. 26, 125-142
Open AccessConstructions of cross Z-complementary sets for training design in spatial modulation
Cross Z-complementary sets (CZCSs) play a crucial role in the design of optimal training sequences for broadband spatial modulation (SM) systems over frequency-selective channels. This paper focuses on the construction of $ q $-ary CZCSs to enhance the performance of such systems. Specifically, we propose two novel constructions for $ (4, N_1 + N_2, \min(N_1 + K_2, N_2 + Z_1)) $-CZCSs and $ (4, 2N+1, N+Z) $-CZCSs. The first construction is obtained by concatenating an $ (N_1, Z_1) $ cross Z-complementary sequence pair (CZCP) that is also a quaternary Golay complementary pair (QGCP) with a QGCP of length $ N_2 $ satisfying an additional correlation constraint, whereas the second construction is developed from $ q $-ary Golay complementary pairs of length $ N $. These results provide flexible parameter choices for practical applications in broadband spatial modulation systems. - 1 January 2025
- Published by American Institute of Mathematical Sciences (AIMS) in Advances in Mathematics of Communications
- Vol. 19 (4) , 1089-1109
Constructions of golay complementary (array) sets based on extended boolean functions
In this paper, we propose a direct construction of Golay complementary sets (GCSs) with flexible length $ aq^m $ for set size $ q^{k} $ using extended Boolean functions (EBFs), where $ a $ and $ q $ are positive integers with $ a\leq q $. As an extension of GCSs, we also propose two-dimensional (2-D) Golay complementary array sets (GCASs) using 2-D EBFs. The parameters of the proposed GCASs are more flexible as compared to the previous works.- 1 January 2025
- Published by American Institute of Mathematical Sciences (AIMS) in Advances in Mathematics of Communications
- Vol. 19 (4) , 1089-1109
Constructions of golay complementary (array) sets based on extended boolean functions
In this paper, we propose a direct construction of Golay complementary sets (GCSs) with flexible length $ aq^m $ for set size $ q^{k} $ using extended Boolean functions (EBFs), where $ a $ and $ q $ are positive integers with $ a\leq q $. As an extension of GCSs, we also propose two-dimensional (2-D) Golay complementary array sets (GCASs) using 2-D EBFs. The parameters of the proposed GCASs are more flexible as compared to the previous works.- Open Access
- 24 January 2023
- Published by Springer Nature in Research Square
A class of optimal frequency hopping sequences based on the decimated m-sequences
In frequency hopping communication system, the correlation characteristic of frequency hopping sequence is an important standard to measure the system performance. Therefore, the design of new frequency hopping sequences with low correlation property has always been one of the important topics in frequency hopping systems. In this paper, we present a class of frequency hopping sequences with respect to the Lempel-Greenberger bound, which is based on the character sums over finite fields and the decimation of m-sequences. The parameters of this frequency hopping sequences are new. Mathematics Subject Classification: 11B50, 11B65, 11B83.
- 24 January 2023
- Published by Springer Nature in Research Square
Open AccessA class of optimal frequency hopping sequences based on the decimated m-sequences
In frequency hopping communication system, the correlation characteristic of frequency hopping sequence is an important standard to measure the system performance. Therefore, the design of new frequency hopping sequences with low correlation property has always been one of the important topics in frequency hopping systems. In this paper, we present a class of frequency hopping sequences with respect to the Lempel-Greenberger bound, which is based on the character sums over finite fields and the decimation of m-sequences. The parameters of this frequency hopping sequences are new. Mathematics Subject Classification: 11B50, 11B65, 11B83.
- 1 January 2023
- Published by American Institute of Mathematical Sciences (AIMS) in Advances in Mathematics of Communications
- Vol. 17 (6) , 1493-1506
Aperiodic/periodic complementary sequence pairs over quaternions
Aperodic (or called Golay)/Periodic complementary pairs (GCPs/ PCPs) are pairs of sequences whose aperiodic/periodic autocorrelation sums are zero everywhere, except at the zero shift. In this paper, we introduce GCPs/PCPs over the quaternion group $ Q_8 $, which is a generalization of quaternary GCPs/PCPs. Some basic properties of autocorrelations of $ Q_8 $-sequences are also obtained. We present three types of constructions for GCPs and PCPs over $ Q_8 $. The main ideas of these constructions are to consider pairs of a $ Q_8 $-sequence and its reverse, pairs of interleaving of sequence, or pairs of Kronecker product of sequences. By choosing suitable sequences in these constructions, we obtain new parameters for GCPs and PCPs, which have not been reported before.- 1 January 2023
- Published by American Institute of Mathematical Sciences (AIMS) in Advances in Mathematics of Communications
- Vol. 17 (6) , 1493-1506
Aperiodic/periodic complementary sequence pairs over quaternions
Aperodic (or called Golay)/Periodic complementary pairs (GCPs/ PCPs) are pairs of sequences whose aperiodic/periodic autocorrelation sums are zero everywhere, except at the zero shift. In this paper, we introduce GCPs/PCPs over the quaternion group $ Q_8 $, which is a generalization of quaternary GCPs/PCPs. Some basic properties of autocorrelations of $ Q_8 $-sequences are also obtained. We present three types of constructions for GCPs and PCPs over $ Q_8 $. The main ideas of these constructions are to consider pairs of a $ Q_8 $-sequence and its reverse, pairs of interleaving of sequence, or pairs of Kronecker product of sequences. By choosing suitable sequences in these constructions, we obtain new parameters for GCPs and PCPs, which have not been reported before.- 19 September 2022
- Published by Springer Nature in Applicable Algebra in Engineering, Communication and Computing
- Vol. 35 (5) , 691-701
Constructions of low-hit-zone frequency hopping sequence sets from cyclic codes
- 19 September 2022
- Published by Springer Nature in Applicable Algebra in Engineering, Communication and Computing
- Vol. 35 (5) , 691-701
Constructions of low-hit-zone frequency hopping sequence sets from cyclic codes
- 11 June 2022
- Published by Springer Nature in Cryptography and Communications
- Vol. 15 (1) , 95-110
Constructions of almost complementary pairs based on non-standard Golay sequences
- 11 June 2022
- Published by Springer Nature in Cryptography and Communications
- Vol. 15 (1) , 95-110
Constructions of almost complementary pairs based on non-standard Golay sequences
- 1 May 2020
- Published by Institute of Electronics, Information and Communications Engineers (IEICE) in IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
- Vol. E103.A (5) , 792-797
New Optimal Difference Systems of Sets from Ideal Sequences and Perfect Ternary Sequences
Difference systems of sets (DSSs) introduced by Levenstein are combinatorial structures used to construct comma-free codes for synchronization. In this letter, two classes of optimal DSSs are presented. One class is obtained based on q-ary ideal sequences with d-form property and difference-balanced property. The other class of optimal and perfect DSSs is derived from perfect ternary sequences given by Ipatov in 1995. Compared with known constructions (Zhou, Tang, Optimal and perfect difference systems of sets from q-ary sequences with difference-balanced property, Des. Codes Cryptography, 57(2), 215-223, 2010), the proposed DSSs lead to comma-free codes with nonzero code rate.
- 1 May 2020
- Published by Institute of Electronics, Information and Communications Engineers (IEICE) in IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
- Vol. E103.A (5) , 792-797
New Optimal Difference Systems of Sets from Ideal Sequences and Perfect Ternary Sequences
Difference systems of sets (DSSs) introduced by Levenstein are combinatorial structures used to construct comma-free codes for synchronization. In this letter, two classes of optimal DSSs are presented. One class is obtained based on q-ary ideal sequences with d-form property and difference-balanced property. The other class of optimal and perfect DSSs is derived from perfect ternary sequences given by Ipatov in 1995. Compared with known constructions (Zhou, Tang, Optimal and perfect difference systems of sets from q-ary sequences with difference-balanced property, Des. Codes Cryptography, 57(2), 215-223, 2010), the proposed DSSs lead to comma-free codes with nonzero code rate.
- 1 November 2018
- Published by Institute of Electronics, Information and Communications Engineers (IEICE) in IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
- Vol. E101.A (11) , 1980-1983
Generalized Krengel-Ivanov Sequences with Optimal Autocorrelation Magnitude
In this letter, we present a class of binary sequences with optimal autocorrelation magnitude. Compared with Krengel-Ivanov sequences, some proposed sequences have different autocorrelation distribution. This indicates those sequences would be new. As an application of constructed binary sequences, we derive a class of quaternary sequences of length 4p with autocorrelation magnitude equal to $2\sqrt{2}$, which is lower than the autocorrelation magnitude equal to 4 of Chung-Han-Yang sequences given in 2011.- 1 November 2018
- Published by Institute of Electronics, Information and Communications Engineers (IEICE) in IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
- Vol. E101.A (11) , 1980-1983
Generalized Krengel-Ivanov Sequences with Optimal Autocorrelation Magnitude
In this letter, we present a class of binary sequences with optimal autocorrelation magnitude. Compared with Krengel-Ivanov sequences, some proposed sequences have different autocorrelation distribution. This indicates those sequences would be new. As an application of constructed binary sequences, we derive a class of quaternary sequences of length 4p with autocorrelation magnitude equal to $2\sqrt{2}$, which is lower than the autocorrelation magnitude equal to 4 of Chung-Han-Yang sequences given in 2011.- 4 August 2017
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 86 (6) , 1329-1338
New optimal binary sequences with period 4p via interleaving Ding–Helleseth–Lam sequences
- 4 August 2017
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 86 (6) , 1329-1338
New optimal binary sequences with period 4p via interleaving Ding–Helleseth–Lam sequences
- Open AccessNew Optimal Binary Sequences with Period $4p$ via Interleaving Ding-Helleseth-Lam SequencesBinary sequences with optimal autocorrelation play important roles in radar, communication, and cryptography. Finding new binary sequences with optimal autocorrelation has been an interesting research topic in sequence design. Ding-Helleseth-Lam sequences are such a class of binary sequences of period $p$, where $p$ is an odd prime with $p\equiv 1(\bmod~4)$. The objective of this letter is to present a construction of binary sequences of period $4p$ via interleaving four suitable Ding-Helleseth-Lam sequences. This construction generates new binary sequences with optimal autocorrelation which can not be produced by earlier ones.Open AccessNew Optimal Binary Sequences with Period $4p$ via Interleaving Ding-Helleseth-Lam SequencesBinary sequences with optimal autocorrelation play important roles in radar, communication, and cryptography. Finding new binary sequences with optimal autocorrelation has been an interesting research topic in sequence design. Ding-Helleseth-Lam sequences are such a class of binary sequences of period $p$, where $p$ is an odd prime with $p\equiv 1(\bmod~4)$. The objective of this letter is to present a construction of binary sequences of period $4p$ via interleaving four suitable Ding-Helleseth-Lam sequences. This construction generates new binary sequences with optimal autocorrelation which can not be produced by earlier ones.