On the stability of periodic binary sequences with zone restriction

03/28/2019
by   Ming Su, et al.
0

Traditional global stability measure for sequences is hard to determine because of large search space. We propose the k-error linear complexity with a zone restriction for measuring the local stability of sequences. Accordingly, we can efficiently determine the global stability by studying a local stability for these sequences. For several classes of sequences, we demonstrate that the k-error linear complexity is identical to the k-error linear complexity within a zone, while the length of a zone is much smaller than the whole period when the k-error linear complexity is large. These sequences have periods 2^n, or 2^v r (r odd prime and 2 is primitive modulo r), or 2^v p_1^s_1... p_n^s_n (p_i is an odd prime and 2 is primitive modulo p_i and p_i^2, where 1≤ i ≤ n) respectively. In particular, we completely determine the spectrum of 1-error linear complexity with any zone length for an arbitrary 2^n-periodic binary sequence.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset
Success!
Error Icon An error occurred

Sign in with Google

×

Use your Google Account to sign in to DeepAI

×

Consider DeepAI Pro