Correlation, Linear Complexity, Maximum order Complexity on Families of binary Sequences

07/25/2021
by   Zhixiong Chen, et al.
0

Correlation measure of order k is an important measure of randomness in binary sequences. This measure tries to look for dependence between several shifted version of a sequence. We study the relation between the correlation measure of order k and another two pseudorandom measures: the Nth linear complexity and the Nth maximum order complexity. We simplify and improve several state-of-the-art lower bounds for these two measures using the Hamming bound as well as weaker bounds derived from it.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/29/2020

Families of sequences with good family complexity and cross-correlation measure

In this paper we study pseudorandomness of a family of sequences in term...
research
05/07/2021

Pseudorandom sequences derived from automatic sequences

Many automatic sequences, such as the Thue-Morse sequence or the Rudin-S...
research
10/09/2019

A new neural-network-based model for measuring the strength of a pseudorandom binary sequence

Maximum order complexity is an important tool for measuring the nonlinea...
research
08/27/2020

Perfect linear complexity profile and Apwenian sequences

Sequences with perfect linear complexity profile were defined more than ...
research
02/03/2021

The Enigma of Complexity

In this paper we examine the concept of complexity as it applies to gene...
research
09/10/2021

Correlation measures of binary sequences derived from Euler quotients

Fermat-Euler quotients arose from the study of the first case of Fermat'...
research
01/08/2019

On Tail Dependence Matrices - The Realization Problem for Parametric Families

Among bivariate tail dependence measures, the tail dependence coefficien...

Please sign up or login with your details

Forgot password? Click here to reset