We estimate the maximum-order complexity of a binary sequence in terms of its correlation measures. Roughly speaking, we show that any sequence with small correlation measure up to a sufficiently large order k cannot have very small maximum-order complexity
Large families of binary sequences of the same length are considered and a new measure, the cross-...
International audienceLarge families of binary sequences of the same length are considered and a new...
Ahlswede R, Cassaigne J, Sarközy A. On the correlation of binary sequences. In: Discrete Applied Ma...
We estimate the maximum-order complexity of a binary sequence in terms of its correlation measures. ...
Abstract: In this paper, we consider the problem of evaluating the complexity of random and pseudo r...
Abstract. Three measures of pseudorandomness of finite binary se-quences were introduced by Mauduit ...
AbstractLet EN=(e1,e2,…,eN) be a binary sequence with ei∈{+1,−1}. For 2≤k≤N, the correlation measure...
Let e N =(e1,e2,...,eN) be a binary sequence with ei ∈{+1, −1}. For 2 ≤ k ≤ N, the correlation measu...
International audienceThis paper concerns the study of the correlation measures of finite binary seq...
AbstractWe estimate the linear complexity profile of m-ary sequences in terms of their correlation m...
International audienceLinear complexity is an important and frequently used measure of unpredictabil...
AbstractThis paper concerns the study of the correlation measures of finite binary sequences, more p...
International audienceLarge families of binary sequences of the same length are considered and a new...
International audienceLarge families of binary sequences of the same length are considered and a new...
In this paper, lower bounds- Welch, Sidelnikov, and Levenshtein bounds- on maximum correlation of a ...
Large families of binary sequences of the same length are considered and a new measure, the cross-...
International audienceLarge families of binary sequences of the same length are considered and a new...
Ahlswede R, Cassaigne J, Sarközy A. On the correlation of binary sequences. In: Discrete Applied Ma...
We estimate the maximum-order complexity of a binary sequence in terms of its correlation measures. ...
Abstract: In this paper, we consider the problem of evaluating the complexity of random and pseudo r...
Abstract. Three measures of pseudorandomness of finite binary se-quences were introduced by Mauduit ...
AbstractLet EN=(e1,e2,…,eN) be a binary sequence with ei∈{+1,−1}. For 2≤k≤N, the correlation measure...
Let e N =(e1,e2,...,eN) be a binary sequence with ei ∈{+1, −1}. For 2 ≤ k ≤ N, the correlation measu...
International audienceThis paper concerns the study of the correlation measures of finite binary seq...
AbstractWe estimate the linear complexity profile of m-ary sequences in terms of their correlation m...
International audienceLinear complexity is an important and frequently used measure of unpredictabil...
AbstractThis paper concerns the study of the correlation measures of finite binary sequences, more p...
International audienceLarge families of binary sequences of the same length are considered and a new...
International audienceLarge families of binary sequences of the same length are considered and a new...
In this paper, lower bounds- Welch, Sidelnikov, and Levenshtein bounds- on maximum correlation of a ...
Large families of binary sequences of the same length are considered and a new measure, the cross-...
International audienceLarge families of binary sequences of the same length are considered and a new...
Ahlswede R, Cassaigne J, Sarközy A. On the correlation of binary sequences. In: Discrete Applied Ma...
DOI
Add to ORKG