5 citations · 21 across the 28 of their papers we have counts for
5 papers · 1 filter
Constructions of Optimal and Near-Optimal Quasi-Complementary Sequence Sets from an Almost Difference Set
Yu Li, Tongjiang Yan, Chuan Lv
Compared with the perfect complementary sequence sets, quasi-complementary sequence sets (QCSSs) can support more users to work in multicarrier CDMA communications. A near-optimal…
A lower bound on the 2-adic complexity of Ding-Helleseth generalized cyclotomic sequences of period
Yuhua Sun, Qiang Wang, Tongjiang Yan +1
Let be an odd prime, a positive integer and a primitive root of . Suppose , , is the general…
A lower bound on the 2-adic complexity of modified Jacobi sequence
Yuhua Sun, Qiang Wang, Tongjiang Yan
Let be distinct primes satisfying and let , , be Whiteman's generalized cyclotomic classes with $Z_{pq}^{\ast}=\cup_{i=0}^{d-…
Autocorrelation and Lower Bound on the 2-Adic Complexity of LSB Sequence of -ary -Sequence
Yuhua Sun, Qiuyan Wang, Tongjiang Yan +1
LSB (Least Significant Bit) sequences are widely used as the initial inputs in some modern stream ciphers, such as the ZUC algorithm-the core of the 3GPP LTE International Encrypti…
The 2-adic complexity of a class of binary sequences with almost optimal autocorrelation
Yuhua Sun, Qiang Wang, Tongjiang Yan
Pseudo-random sequences with good statistical property, such as low autocorrelation, high linear complexity and large 2-adic complexity, have been applied in stream cipher. In gene…