Perfect linear complexity profile and apwenian sequences

From MaRDI portal
Publication:1994979

DOI10.1016/J.FFA.2020.101761zbMATH Open1464.11077arXiv2008.12160OpenAlexW3090185765MaRDI QIDQ1994979FDOQ1994979


Authors: Guo-Niu Han, Jean-Paul Allouche, Harald Niederreiter Edit this on Wikidata


Publication date: 18 February 2021

Published in: Finite Fields and their Applications (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/2008.12160




Recommendations




Cites Work


Cited In (9)





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)