THE 2-ERROR LINEAR COMPLEXITY OF 2~n-PERIODIC BINARY SEQUENCES WITH LINEAR COMPLEXITY 2~n-1

Linear complexity and k-error linear complexity of the stream cipher are two important standards to scale the randomicity of keystreams. For the 2n -periodicperiodic binary sequence with linear complexity 2n 1and k = 2,3,the number of sequences with given k-error linear complexity and the expected k-error linear complexity are provided. Moreover,the proportion of the sequences whose k-error linear complexity is bigger than the expected value is analyzed.

Linear Complexity of Some Binary Sequences Derived from Fermat Quotients

We determined the linear complexity of a family of p2-periodic binary threshold sequences and a family of p2-periodic binary sequences constructed using the Legendre symbol,both of which are derived from Fermat quotients modulo an odd prime p.If 2 is a primitive element modulo p2,the linear complexity equals to p2-p or p2-1,which is very close to the period and it is large enough for cryptographic purpose.

The k-Error Linear Complexity and the Linear Complexity for pq^n-Periodic Binary Sequences

The k-error linear complexity and the linear complexity of the keystream of a stream cipher are two important standards to scale the randomness of the key stream. For a pq^n-periodic binary sequences where p, q are two odd primes satisfying that 2 is a primitive root module p and q^2 and gcd（p-1, q-1） = 2, we analyze the relationship between the linear complexity and the minimum value k for which the k-error linear complexity is strictly less than the linear complexity.

Modified constructions of binary sequences using multiplicative inverse

Two new families of finite binary sequences are constructed using multiplicative inverse. The sequences are shown to have strong pseudorandom properties by using some estimates of certain exponential sums over finite fields. The constructions can be implemented fast since multiplicative inverse over finite fields can be computed in polynomial time.

OVERSAMPLED CHAOTIC BINARY SEQUENCES FOR MULTIPLE ACCESS COMMUNICATION

Noise interfereuce and multiple access interference are the main impairment to the performance of DS/CDMA communication system. This letter presents that OverSampled Chaotic Map (OSCM) binary sequences are secure as spreading sequences, and based on the optimal quantizing method, the BER performance of the system has been derived in detail. the internal relationships among the number of users, the power of noise and the length of code chips are revealed in mathematical formulae. The performance of the system can be improved by employing these formulae. Numerical results conform the efficiency of discussion in this letter.

Binary Phase Shaping and SHG Contrast Ratios

Finding binary sequences with Large SHG ratios is very important in the field of ultrafast science, biomedical optics, high-resolution microscopy and label-free imaging. In this paper, we have demonstrated the relation between the SHG contrast ratio and the traditional Merit Factor values. And in the light from known results in Merit Factor Problems, we have shown that Legendre Sequences or Jacobi Sequences, are still the best candidates to obtain binary sequences with large SHG contrast ratios. The authors also discussed the SHG behaviors on some sequences obtained from cyclotomic classes over the finite field GF (2l) .

New theoretical bounds on the aperiodic correlation functions of binary sequences

In order to reduce or eliminate the multiple access interference in code division multiple access (CDMA) systems, we need to design a set of spreading sequences with good autocorrelation functions (ACF) and crosscorrelation functions (CCF). The importance of the spreading codes to CDMA systems cannot be overemphasized, for the type of the code used, its length, and its chip rate set bounds on the capability of the system that can be changed only by changing the code. Several new lower bounds which are stronger than the well-known Sarwate bounds, Welch bounds and Levenshtein bounds for binary sequence set with respect to the spreading sequence length, family size, maximum aperiodic autocorrelation sidelobe and maximum aperiodic crosscorrelation value are established.

On GF(p)-linear complexities of binary sequences

Several geometric sequences have very low linear complexities when considered as sequences over GF（p）, such as the binary sequences of period q^n - 1 constructed by Chan and Games [1-2] （q is a prime power p^m, p is an odd prime） with the maximal possible linear complexity q^n-1 when considered as sequences over GF（2）. This indicates that binary sequences with high GF（2） linear complexities LC2 and low GF（p）-linear complexities LCp are not secure for use in stream ciphers. In this article, several lower bounds on the GF（p）-linear complexities of binary sequences is proved and the results are applied to the GF（p）-linear complexities of Blum-Blum-Shub, self-shrinking, and de Bruijn sequences. A lower bound on the number of the binary sequences with LC2 〉 LCD is also presented.

Measuring nonlinearity by means of static parameters in Bernoulli binary sequences distribution:A brief approach

This paper analyzes Bernoulli’s binary sequences in the representation of empirical nonlinear events,analyzing the distribution of natural resources,population sizes and other variables that influence the possible outcomes of resource’s usage.Consider the event as a nonlinear system and the metrics of analysis consisting of two dependent random variables 0 and 1,with memory and probabilities in maximum finite or infinite lengths,constant and equal to 1/2 for both variables(stationary process).The expressions of the possible trajectories of metric space represented by each binary parameter remain constant in sequences that are repeated alternating the presence or absence of one of the binary variables at each iteration(symmetric or asymmetric).It was observed that the binary variables X_(1)and X_(2)assume on time T_(k)→∞specific behaviors(geometric variable)that can be used as management tools in discrete and continuous nonlinear systems aiming at the optimization of resource’s usage,nonlinearity analysis and probabilistic distribution of trajectories occurring about random events.In this way,the paper presents a model of detecting fixed-point attractions and its probabilistic distributions at a given population-resource dynamic.This means that coupling oscillations in the event occur when the binary variables X_(1)and X_(2)are limited as a function of time Y.

Refined Convergents to the Associated Continued Fractions for Binary Sequences

The relation between continued fractions and Berlekamp’s algorithm was studied by some reseachers. The latter is an iterative procedure proposed for decoding BCH codes. However, there remains an unanswered question whether each of the iterative steps in the algorithm can be interpreted in terms of continued fractions. In this paper, we first introduce the so-called refined convergents to the continued fraction expansion of a binary sequence s, and then give a thorough answer to the question in the context of Massey’s linear feedback shift register synthesis algorithm which is equivalent to that of Berlekamp, and at last we prove that there exists a one- to-one correspondence between the n-th refined convergents and the length n segments.

Binary sequences-based approach for construction of evolutionary network

Evolutionary studies have been of prime importance to life scientists since ancient times. The advancements in technology has made it possible to make available the massive amounts of genomic data. The abundance of genomic data poses new challenges for biologists, computer scientists and mathematicians to develop approaches for discovery of new relationships in data and evolutionary networks. In this work, nucleotide sequences are converted into binary sequences to explore the network among different species. A new approach based on binary sequences has been proposed to reconstruct the accurate phylogenetic network. The algorithm developed is validated by comparing the results with those obtained by already existing method of network construction. A program is also coded in C language on the Intel Core i3 Dell inspiron machine to obtain the evolutionary network. The new approach developed also provides the fast solutions as there is no need of aligning the sequences.

Study the Multiplication M-sequences and Its Reciprocal Sequences

M-Sequences play a big important role,as the other binary orthogonal sequences,for collection the information on the input links and distribution these information on the output links of the communication channels and for building new systems with more complexity,larger period,and security,through multiplication these sequences.In our article we try to study the construction of the multiplication sequence{zn}and its linear equivalent,this multiplication sequence is as multiple two sequences,the first sequence{an}is an arbitrary M-sequence and the second sequence{bn}is not completely different but is the reciprocal sequence of the first sequence{an}that is the reciprocal sequence has characteristic polynomial g(x)is reciprocal of f(x),which is the characteristic polynomial of the first sequence{an},also we will study the linear equivalent of the multiplication sequence{zn}and we will see that the length of the linear equivalent of{zn}is equal to((deg f(x))^(2)-deg(f(x)).

PERIODIC COMPLEMENTARY BINARY SEQUENCE PAIRS

A new set of binary sequences-Periodic Complementary Binary Sequence Pair (PCSP) is proposed. A new class of block design-Difference Family Pair (DFP) is also proposed.The relationship between PCSP and DFP, the properties and existing conditions of PCSP and the recursive constructions for PCSP are given.

PERFECT PUNCTURED BINARY SEQUENCE PAIRS

This paper presents the definition of perfect punctured binary sequence pair and the combinatorial admissible conditions for searching the perfect punctured binary sequence pairs and proves that all of the pseudo-random binary sequences satisfy these conditions. Computer calculation verifies that the pseudo-random binary sequences with length up to N=127 can be easily turned into perfect punctured binary sequence pairs.

Constructions for almost perfect binary sequence pairs with even length

The concept of the binary sequence pair is generalized from a single binary sequence. Binary sequence pairs are applied in many fields of radar, sonar or communication systems, in which signals with optimal periodic correlation are required. Several types of almost perfect binary sequence pairs of length T = 2q are constructed, where q is an odd number. These almost perfect binary sequence pairs are based on binary ideal sequence or binary ideal two-level correlation sequence pairs by using Chinese remainder theorem. For these almost perfect binary sequence pairs with good balanced property, their corresponding divisible difference set pairs(DDSPs) are also derived.

THE CONSTRUCTIONS OF ALMOST BINARY SEQUENCE PAIRS WITH THREE-LEVEL CORRELATION BASED ON CYCLOTOMY

In this paper,a new class of almost binary sequence pair with a single zero element is presented.The almost binary sequence pairs with three-level correlation are constructed based on cyclotomic numbers of order 2,4,and 6.Most of them have good correlation and balance property,whose maximum nontrivial correlation magnitudes are 2 and the difference between the numbers of occurrence of +1's and-1's are 0 or 1.In addition,the corresponding binary sequence pairs are investigated as well and we can also get some kinds of binary sequence pairs with optimum balance and good correlation.

A formulation methodology for multicomponent distillation sequences based on stochastic optimization

Based on stochastic optimization strategy, a formulation methodology is proposed for synthesizing distillation column sequences, allowing more than one middle component as the distributing components between a pair of key components in the non-sharp split. In order to represent and manipulate the distillation configuration structures, a new coding procedure is proposed in the form of one-dimensional array. Theoretically, an array can represent any kind of split(non-sharp and sharp). With the application of a binary sort tree approach, a robust flow sheet encoding and decoding procedure is developed so that the problem formulation and solution becomes tractable. In this paper,the synthesis problem is formulated as a mixed-integer nonlinear programming(MINLP) problem and an improved simulated annealing approach is adopted to solve the optimization problem. Besides, a shortcut method is applied to the evaluation of all required design parameters as well as the total function.

Gait Recognition by Cross Wavelet Transform and Graph Model

In this paper, a multi-view gait based human recognition system using the fusion of two kinds of features is proposed.We use cross wavelet transform to extract dynamic feature and bipartite graph model to extract static feature which are coefficients of quadrature mirror filter(QMF)-graph wavelet filter bank. Feature fusion is done after normalization. For normalization of features, min-max rule is used and mean-variance method is used to find weights for normalized features. Euclidean distance between each feature vector and center of the cluster which is obtained by k-means clustering is used as similarity measure in Bayesian framework. Experiments performed on widely used CASIA B gait database show that, the fusion of these two feature sets preserve discriminant information. We report 99.90 % average recognition rate.

10 Gbit/s PRBS tester implemented in FPGA

The design of an FPGA（ field programmable gate array） based programmable SONET （synchronous optical network） OC-192 10 Gbit/s PRBS （pseudo-random binary sequence） generator and a bit interleaved polarity 8 （BIP-8） error detector is presented. Implemented in a parallel feedback configuration, this tester features PRBS generation of sequences with bit lengths of 2^7 - 1,2^10- 1,2^15 - 1,2^23 - land 2^31 - 1 for up to 10 Gbit/s applications with a 10 Gbit/s optical transceiver, via the SFI-4 （OC-192 serdes-framer interface）. In the OC-192 frame alignment circuit, a dichotomy search algorithm logic which performs the functions of word alignment and STM-64/OC192 de-frame speeds up the frame sync logic and reduces circuit complexity greatly. The system can be used as a low cost tester to evaluate the performance of OC-192 devices and components, taking the replacement of precious commercial PRBS testers.

Periodic performance of the chaotic spread spectrum sequence on finite precision

It is well known that the periodic performance of spread spectrum sequence heavily affects the correlative and secure characteristics of communication systems. The chaotic binary sequence is paid more and more attention since it is one kind of applicable spread spectrum sequences. However, there are unavoidable short cyclic problems for chaotic binary sequences in finite precision. The chaotic binary sequence generating methods are studied first. Then the short cyclic behavior of the chaotic sequences is analyzed in detail, which are generated by quantification approaches with finite word-length. At the same time, a chaotic similar function is defined for presenting the cyclic characteristics of the sequences. Based on these efforts, an improved method with scrambling control for generating chaotic binary sequences is proposed. To quantitatively describe the improvement of periodic performance of the sequences, an orthogonal estimator is also defined. Some simulating results are provided. From the theoretical deduction and the experimental results, it is concluded that the proposed method can effectively increase the period and raise the complexity of the chaotic sequences to some extent.