On the linear complexity and the autocorrelation of generalized cyclotomic binary sequences of length 2p m

In this article, new classes of generalized cyclotomic binary sequences with period 2p ^m are proposed. We determine the linear complexity and autocorrelation of these sequences. The results show that the proposed generalized cyclotomic binary sequences have high linear complexity, but do not have desirable autocorrelation properties.     

On the properties of generalized cyclotomic binary sequences of period $$2p^m$$ 2 p m

Designs, Codes and Cryptography - Xiao, Zeng, Li and Helleseth proposed new generalized cyclotomic binary sequences $$s^{infty }$$ of period $$p^m$$ and showed that these sequences are almost...     

New generalized cyclotomic binary sequences of period $$p^2$$

New generalized cyclotomic binary sequences of period \(p^2\) are proposed in this paper, where p is an odd prime. The sequences are almost balanced and their linear complexity is determined. The result shows that the proposed sequences have very large linear complexity if p is a non-Wieferich prime.     

There are no de bruijn sequences of span n with complexity 2n − 1 + n + 1

If s = (s₀, s₁,…, s_2ⁿ?1) is a binary de Bruijn sequence of span n, then it has been shown that the least length of a linear recursion that generates s, called the complexity of s and denoted by c(s), is bounded for n ? 3 by 2^{n ? 1} + n ? c(s) ? 2ⁿ ?1. A numerical study of the allowable values of c(s) for 3 ? n ? 6 found that all values in this range occurred except for 2^n?1 + n + 1. It is proven in this note that there are no de Bruijn sequences of complexity 2^n?1 + n + 1 for all n ? 3.     

Fast algorithms for determining the linear complexities of sequences over GF(p m) with the period 3n

In this paper, for the the primes p such that 3 is a divisor of p ? 1, we prove a result which reduces the computation of the linear complexity of a sequence over GF(p ^m) (any positive integer m) with the period 3n (n and p ^m ? 1 are coprime) to the computation of the linear complexities of three sequences with the period n. Combined with some known algorithms such as generalized Games-Chan algorithm, Berlekamp-Massey algorithm and Xiao-Wei-Lam-Imamura algorithm, we can determine the linear complexity of any sequence over GF(p ^m) with the period 3n (n and p ^m ? 1 are coprime) more efficiently.     

On evaluating the linear complexity of a sequence of least period 2 n

The linear complexity of a periodic binary sequence is the length of the shortest linear feedback shift register that can be used to generate that sequence. When the sequence has least period 2 ⁿ ,n0, there is a fast algorithm due to Games and Chan that evaluates this linear complexity. In this paper a related algorithm is presented that obtains the linear complexity of the sequence requiring, on average for sequences of period 2 ⁿ ,n0, no more than 2 parity checks sums.     

A counterexample concerning the 3-error linear complexity of 2 n -periodic binary sequences

In this article, we present a counterexample to Theorem 4.2 and Theorem 5.2 by Kavuluru (Des Codes Cryptogr 53:75–97, 2009). We conclude that the counting functions for the number of 2 ⁿ -periodic binary sequences with fixed 3-error linear complexity by Kavuluru are not correct.     

FCSR序列的线性复杂度

§ 1　 IntroductionFeedback with carry shift register(FCSR) was first introduced by Klapper andGoresky in1 994[1 ] .The main idea of FCSR is to add a memory to linearfeedback shiftreg-ister(LFSR) .The structure is depicted in Fig.1 ,Fig.1where mn- 1 ∈Z,ai,qi∈ { 0 ,1 } and qr=1 .We refer to mn- 1 as memory,(mn- 1 ,an- 1 ,...,an- r)as state,r=log(q+ 1 ) as length,and q=-1 + q1 · 2 + ...+ qr· 2 ras connection integerof FCSR.The operation of the shiftregister is defined as follows:(1 …     

Fast algorithms for determining the linear complexities of sequences over GF(p~m) with the period 3n

In this paper, for the the primes p such that 3 is a divisor of p-1, we prove a result which reduces the computation of the linear complexity of a sequence over GF(pm)(any positive integer m) with the period 3n (n and pm - 1 are coprime) to the computation of the linear complexities of three sequences with the period n. Combined with some known algorithms such as generalized Games-Chan algorithm, Berlekamp-Massey algorithm and Xiao-Wei-Lam-lmamura algorithm, we can determine the linear complexity of any sequence over GF(pm) with the period 3n (n and pm - 1 are coprime) more efficiently.     

U(n + 1) × U(p + 1)-Hermitian metrics on the manifold S 2n+1 × S 2p+1

A two-parameter family of invariant almost-complex structures J _α,c is given on the homogeneous space M × M’ = U(n + 1)/U(n) × U(p + 1)/U(p); all these structures are integrable. We consider all invariant Riemannian metrics on the homogeneous space M × M’. They depend on five parameters and are Hermitian with respect to some complex structure J _α,c . In this paper, we calculate the Ricci tensor, scalar curvature, and obtain estimates of the sectional curvature for any metric on M × M’. All the invariant metrics of nonnegative curvature are described. We obtain the extremal values of the scalar curvature functional on the four-parameter family of metrics g _{α,c,λ,λ’;1} .     

基于代数曲线上具有高广义联合线性复杂度的多重序列

多重序列的联合线性复杂度是衡量基于字的流密码体系安全的一个重要指标. 由元素取自F_q上的m 重序列和元素取自F_q^m 上的单个序列之间的一一对应, Meidl 和Özbudak 定义多重序列的广义联合线性复杂度为对应的单个序列的线性复杂度. 在本文中, 我们利用代数曲线的常数域扩张, 研究两类多重序列的广义联合线性复杂度. 更进一步, 我们指出这两类多重序列同时具有高联合线性复杂度和高广义联合线性复杂度.     

Über Primzahlen der Formn2 n +1 bzw.p2 p +1

Using Selberg's sieve upper bounds for the number of primes of the formn2 ⁿ +1 withn≤x and the number of primes of the formp2 ^p +1 withp≤x are derived.     

A lower estimate for the computation complexity of a ternary linear function

The computation complexity of a ternary linear function of n variables is found to be at least $n^2 + \tfrac{3} {2}n - o(n)$ .     

The linear complexity of a class of binary sequences with optimal autocorrelation

Binary sequences with optimal autocorrelation and large linear complexity have important applications in cryptography and communications. Very recently, a class of binary sequences of period 4p with optimal autocorrelation was proposed by interleaving four suitable Ding–Helleseth–Lam sequences (Des. Codes Cryptogr.,  https://doi.org/10.1007/s10623-017-0398-5), where p is an odd prime with \(p \equiv 1(\bmod 4)\). The objective of this paper is to determine the minimal polynomial and the linear complexity of this class of binary optimal sequences via a sequence polynomial approach. It turns out that this class of sequences has quite good linear complexity.     

On the solution and complexity of a generalized linear complementarity problem

We introduce some sufficient conditions under which a generalized linear complementarity problem (GLCP) can be solved as a pure linear complementarity problem. We also establish that the GLCP is in general a NP-Hard problem.Support of this work has been provided by the Instituto Nacional de Investigação Cientifica de Portugal (INIC) under contract 89/EXA/5.     

Minimization principles and computation for the generalized linear response eigenvalue problem

The minimization principle and Cauchy-like interlacing inequalities for the generalized linear response eigenvalue problem are presented. Based on these theoretical results, the best approximations through structure-preserving subspace projection and a locally optimal block conjugate gradient-like algorithm for simultaneously computing the first few smallest eigenvalues with the positive sign are proposed. Numerical results are presented to illustrate essential convergence behaviors of the proposed algorithm.     

Correlation measure,linear complexity and maximum order complexity for families of binary sequences

The correlation measure of order k is an important measure of pseudorandomness for binary sequences. This measure tries to look for dependence between several shifted versions of a sequence. We study the relation between the correlation measure of order k and two other pseudorandom measures: the Nth linear complexity and the Nth maximum order complexity. We simplify and improve several state-of-the-art lower bounds for these two measures using the Hamming bound as well as weaker bounds derived from it.