AbstractWe estimate the linear complexity profile of m-ary sequences in terms of their correlation measure, which was introduced by Mauduit and Sárközy. For prime m this is a direct extension of a result of Brandstätter and the second author. For composite m, we define a new correlation measure for m-ary sequences, relate it to the linear complexity profile and estimate it in terms of the original correlation measure. We apply our results to sequences of discrete logarithms modulo m and to quaternary sequences derived from two Legendre sequences
One of the main contributions which Harald Niederreiter made to mathematics is related to pseudorand...
In this paper we introduce new M-ary sequences of length pq, called generalized M-ary related-prime ...
We improve several results in the area of pseudorandom sequences. First, we obtain an improved bound...
Let m be a positive integer. We study the linear complexity profile and correlation measure of two i...
Abstract. Three measures of pseudorandomness of finite binary se-quences were introduced by Mauduit ...
Abstract We discuss the linear complexity of a family of binary threshold sequence defined by the di...
We estimate the maximum-order complexity of a binary sequence in terms of its correlation measures. ...
AbstractIn this paper we use the successive minima profile to measure structural properties of pseud...
International audienceLinear complexity is an important and frequently used measure of unpredictabil...
Recently, multisequences have gained increasing interest for applications in cryptography and quasi-...
We estimate the maximum-order complexity of a binary sequence in terms of its correlation measures. ...
Summary. * We study the distribution of s-dimensional points of digital explicit inversive pseudoran...
In modern communication system, cryptography and automatic test patterns, some specific sequences wi...
AbstractLinear complexity and linear complexity profile are interesting characteristics of a sequenc...
Summary form only given. The author extends Reuppel's concept of the linear complexity profile of bi...
One of the main contributions which Harald Niederreiter made to mathematics is related to pseudorand...
In this paper we introduce new M-ary sequences of length pq, called generalized M-ary related-prime ...
We improve several results in the area of pseudorandom sequences. First, we obtain an improved bound...
Let m be a positive integer. We study the linear complexity profile and correlation measure of two i...
Abstract. Three measures of pseudorandomness of finite binary se-quences were introduced by Mauduit ...
Abstract We discuss the linear complexity of a family of binary threshold sequence defined by the di...
We estimate the maximum-order complexity of a binary sequence in terms of its correlation measures. ...
AbstractIn this paper we use the successive minima profile to measure structural properties of pseud...
International audienceLinear complexity is an important and frequently used measure of unpredictabil...
Recently, multisequences have gained increasing interest for applications in cryptography and quasi-...
We estimate the maximum-order complexity of a binary sequence in terms of its correlation measures. ...
Summary. * We study the distribution of s-dimensional points of digital explicit inversive pseudoran...
In modern communication system, cryptography and automatic test patterns, some specific sequences wi...
AbstractLinear complexity and linear complexity profile are interesting characteristics of a sequenc...
Summary form only given. The author extends Reuppel's concept of the linear complexity profile of bi...
One of the main contributions which Harald Niederreiter made to mathematics is related to pseudorand...
In this paper we introduce new M-ary sequences of length pq, called generalized M-ary related-prime ...
We improve several results in the area of pseudorandom sequences. First, we obtain an improved bound...