Perfect linear complexity profile and apwenian sequences

From MaRDI portal
Publication:1994979




Abstract: Sequences with {em perfect linear complexity profile} were defined more than thirty years ago in the study of measures of randomness for binary sequences. More recently {em apwenian sequences}, first with values pm1, 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.



Cites work







This page was built for publication: Perfect linear complexity profile and apwenian sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1994979)