Results 11 to 18 of about 94 (18)
Maximum-order Complexity and Correlation Measures
, 2017 We estimate the maximum-order complexity of a binary sequence in terms of its correlation measures. Roughly speaking, we show that any sequence with small correlation measure up to a sufficiently large order $k$ cannot have very small maximum-order ...
Işık, Leyla, Winterhof, Arne
core +1 more source
Expansion complexity and linear complexity of sequences over finite fields
, 2016 The linear complexity is a measure for the unpredictability of a sequence over a finite field and thus for its suitability in cryptography. In 2012, Diem introduced a new figure of merit for cryptographic sequences called expansion complexity.
Mérai, László +2 more
core +1 more source
Linear complexity problems of level sequences of Euler quotients and their related binary sequences
, 2014 The Euler quotient modulo an odd-prime power $p^r~(r>1)$ can be uniquely decomposed as a $p$-adic number of the form $$ \frac{u^{(p-1)p^{r-1}} -1}{p^r}\equiv a_0(u)+a_1(u)p+\ldots+a_{r-1}(u)p^{r-1} \pmod {p^r},~ \gcd(u,p)=1, $$ where $0\le a_j(u)1$.
Chen, Zhixiong, Du, Xiaoni, Niu, Zhihua
core +1 more source
Three new classes of optimal frequency-hopping sequence sets
, 2016 The study of frequency-hopping sequences (FHSs) has been focused on the establishment of theoretical bounds for the parameters of FHSs as well as on the construction of optimal FHSs with respect to the bounds. Peng and Fan (2004) derived two lower bounds
Chen, Bocong +3 more
core +1 more source
The Cycle Structure of LFSR with Arbitrary Characteristic Polynomial over Finite Fields
, 2016 We determine the cycle structure of linear feedback shift register with arbitrary monic characteristic polynomial over any finite field. For each cycle, a method to find a state and a new way to represent the state are proposed.Comment: An extended ...
Chang, Zuling +3 more
core +1 more source
A note on the multiple-recursive matrix method for generating pseudorandom vectors
, 2017 The multiple-recursive matrix method for generating pseudorandom vectors was introduced by Niederreiter (Linear Algebra Appl. 192 (1993), 301-328). We propose an algorithm for finding an efficient primitive multiple-recursive matrix method. Moreover, for
Bishoi, Susil Kumar +2 more
core +1 more source
On the Divisibility of Trinomials by Maximum Weight Polynomials over F2 [PDF]
, 2013 Divisibility of trinomials by given polynomials over finite fields has been studied and used to construct orthogonal arrays in recent literature.
Kim, Ryul, Ri, Myong-Hui, Song, Ok-Hyon
core
New results on non-disjoint and classical strong external difference families. [PDF]
Des Codes CryptogrHuczynska S, Hume S.
europepmc +1 more source