57,477 research outputs found
On the calculation of the linear complexity of periodic sequences
Based on a result of Hao Chen in 2006 we present a general procedure how to reduce the determination of the linear complexity of a sequence over a finite field \F_q of period to the determination of the linear complexities of sequences over \F_q of period . We apply this procedure to some classes of
periodic sequences over a finite field \F_q obtaining efficient algorithms to determine the linear complexity
How to determine linear complexity and -error linear complexity in some classes of linear recurring sequences
Several fast algorithms for the determination of the linear complexity of -periodic sequences over a finite
field \F_q, i.e. sequences with characteristic polynomial , have been proposed in the literature.
In this contribution fast algorithms for determining the linear complexity of binary sequences with characteristic
polynomial for an arbitrary positive integer , and are presented.
The result is then utilized to establish a fast algorithm for determining the -error linear complexity of
binary sequences with characteristic polynomial
On Binary de Bruijn Sequences from LFSRs with Arbitrary Characteristic Polynomials
We propose a construction of de Bruijn sequences by the cycle joining method
from linear feedback shift registers (LFSRs) with arbitrary characteristic
polynomial . We study in detail the cycle structure of the set
that contains all sequences produced by a specific LFSR on
distinct inputs and provide a fast way to find a state of each cycle. This
leads to an efficient algorithm to find all conjugate pairs between any two
cycles, yielding the adjacency graph. The approach is practical to generate a
large class of de Bruijn sequences up to order . Many previously
proposed constructions of de Bruijn sequences are shown to be special cases of
our construction
Recommended from our members
Layered cellular automata for pseudorandom number generation
The proposed Layered Cellular Automata (L-LCA), which comprises of a main CA with L additional layers of memory registers, has simple local interconnections and high operating speed. The time-varying L-LCA transformation at each clock can be reduced to a single transformation in the set formed by the transformation matrix of a maximum length Cellular Automata (CA), and the entire transformation sequence for a single period can be obtained. The analysis for the period characteristics of state sequences is simplified by analyzing representative transformation sequences determined by the phase difference between the initial states for each layer. The L-LCA model can be extended by adding more layers of memory or through the use of a larger main CA based on widely available maximum length CA. Several L-LCA (L=1,2,3,4) with 10- to 48-bit main CA are subjected to the DIEHARD test suite and better results are obtained over other CA designs reported in the literature. The experiments are repeated using the well-known nonlinear functions and in place of the linear function used in the L-LCA. Linear complexity is significantly increased when or is used
Remarks on the k-error linear complexity of p(n)-periodic sequences
Recently the first author presented exact formulas for the number of 2âżn-periodic binary sequences with given 1-error linear complexity, and an exact formula for the expected 1-error linear complexity and upper and lower bounds for the expected k-error linear complexity, k >2, of a random 2âżn-periodic binary sequence. A crucial role for the analysis played the Chan-Games algorithm. We use a more sophisticated generalization of the Chan-Games algorithm by Ding et al. to obtain exact formulas for the counting function and the expected value for the 1-error linear complexity for pâżn-periodic sequences over Fp, p prime. Additionally we discuss the calculation of lower and upper bounds on the k-error linear complexity of pâżn-periodic sequences over Fp
- âŠ