5 citations · 6 across the 3 of their papers we have counts for
3 papers
cs.IT2021★ 5 cited
Binary sequences with length n and nonlinear complexity not less than n/2
Sicheng Liang, Xiangyong Zeng, Zibi Xiao +1
In this paper, the construction of finite-length binary sequences whose nonlinear complexity is not less than half of the length is investigated. By characterizing the structure of…
math.CO2019
On the maximum order complexity of subsequences of the Thue-Morse and Rudin-Shapiro sequence along squares
Zhimin Sun, Arne Winterhof
Automatic sequences such as the Thue-Morse sequence and the Rudin-Shapiro sequence are highly predictable and thus not suitable in cryptography. In particular, they have small expa…
math.CO2019★ 1 cited
On the maximum order complexity of the Thue-Morse and Rudin-Shapiro sequence
Zhimin Sun, Arne Winterhof
Expansion complexity and maximum order complexity are both finer measures of pseudorandomness than the linear complexity which is the most prominent quality measure for cryptograph…