In this paper we give an approximate probability distribution for the maximum order complexity of a random binary sequence This enables the development of statistical tests based on maximum order complexity for the testing of a binary sequence generator These tests are analogous to those based on linear complexity

A k-bounded priority queue transforms an input sequence CT into an output sequence z which is a re-ordering of the sequence c while never storing more than k elements during the transformation. We consider the set of all such related pairs (a, 7) in both the case that cs is a binary sequence and the case that o is a permutation of 1,2,. , n. We derive properties of this relation and use it to d...

We introduce a binary, relaxed gradient, trust-region method for optimizing pulse sequences single flux quanta control of quantum computer. The are optimized with the goal realizing unitary gate transformations. Each has fixed amplitude and duration. model this process as binary optimal problem, constrained by Schrödinger’s equation, where variables indicate whether each is on or off. first-ord...

We consider the asymptotic merit factor of two binary sequence families obtained from an initial binary sequence family using a “negaperiodic” and a “periodic” construction. When the initial sequences are m-sequences, both of the constructed families have the same asymptotic merit factor as the initial family, at all rotations of sequence elements. A similar property was previously shown to hol...

This paper proposes the use of the binary primes sequence to strengthen pseudorandom (PN) decimal sequences for cryptography applications. The binary primes sequence is added to the PN decimal sequence (where one can choose from many arbitrary shift values) and it is shown that the sum sequence has improved autocorrelation properties besides being computationally hard. Also, an analysis on the ...

The linear complexity and k-error linear complexity of a sequence have been used as important measures of keystream strength, hence designing a sequence with high linear complexity and k-error linear complexity is a popular research topic in cryptography. In this paper, the concept of stable k-error linear complexity is proposed to study sequences with stable and large k-error linear complexity...

Binary sequence sets with asymptotically optimal auto/cross-correlation peak sidelobe level (PSL) growth have been known in the literature for a long time, and their construction has been studied both analytically and numerically. In contrast, it has been a long-standing problem whether we can construct a family of binary sequences whose auto-correlation PSL grows in an optimal manner. In this ...

In this correspondence, we present a construction, in a closed form, for an optimal family of 2m binary sequences of period 2 1 with respect to Welch’s bound, whenever there exists a balanced binary sequence of period 2m 1 with ideal autocorrelation property using the trace function. This construction enables us to reinterpret a small set of Kasami and No sequences as a family constructed from ...

This article discusses how to use queue to make non-recursion algorithm of binary link tree. As for a general binary tree, if we adopt sequence storage, firstly we should extend it first into a complete binary tree, secondly we store it to a temporary queue according to the sequence of up-down and left-right. On the basis of the properties of the complete binary tree and the queue, if we can co...