Perfect linear complexity profile and Apwenian sequences

08/27/2020
by   J. -P. Allouche, et al.
0

Sequences with perfect linear complexity profile were defined more than thirty years ago in the study of measures of randomness for binary sequences. More recently apwenian sequences, first with values ± 1, then with values in {0, 1}, were introduced in the study of Hankel determinants of automatic sequences. We explain that these two families of sequences are the same up to indexing, and give consequences and questions that this implies. We hope that this will help gathering two distinct communities of researchers.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/24/2020

The 2-Adic Complexity of Two Classes of Binary Sequences with Interleaved Structure

The autocorrelation values of two classes of binary sequences are shown ...
research
10/10/2019

On k-error linear complexity of binary sequences derived from Euler quotients modulo 2p

We consider the k-error linear complexity of binary sequences derived fr...
research
07/25/2021

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

Correlation measure of order k is an important measure of randomness in ...
research
05/01/2019

New Infinite Families of Perfect Quaternion Sequences and Williamson Sequences

We present new constructions for perfect and odd perfect sequences over ...
research
11/22/2017

Linear complexity of quaternary sequences over Z4 based on Ding-Helleseth generalized cyclotomic classes

A family of quaternary sequences over Z4 is defined based on the Ding-He...
research
06/24/2022

New Classes of Binary Sequences with High Merit Factor

The Merit Factor (MF) measure was first introduced by Golay in 1972. Seq...
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'...

Please sign up or login with your details

Forgot password? Click here to reset