Titlebook: Sequences and Their Applications - SETA 2004; Third International Tor Helleseth,Dilip Sarwate,Kyeongcheol Yang Conference proceedings 2005

性满足

Asymptotic Behavior of Normalized Linear Complexity of Multi-sequencesion, where . is the linear complexity of the length . prefix of s̱ and defined to be the length of the shortest multi-tuple linear feedback shift register which generates the length . prefix of s̱. A formula for . together with a lower bound, and a formula for . together with an upper bound are give

增长

A Unified View on Sequence Complexity Measures as Isometriesorm way as ...This isometric setting allows to sort out nonrandom sequences as they violate the bounds of the ”Law of the Iterated Logarithm”..We also consider the computational complexity of calculating the isometric models, as well as how to deal with finite sequences.

jettison

On the Generalized Lauder-Paterson Algorithm and Profiles of the ,-Error Linear Complexity for Exponof the Lauder-Paterson algorithm into a sequence over .(..) with period .., where . is a prime and ., . are positive integers, is proposed. We discuss memory and computation complexities of proposed algorithm. Moreover numerical examples of profiles for balanced binary and ternary exponent periodic

Digitalis

endure

On the 2-Adic Complexity and the k-Error 2-Adic Complexity of Periodic Binary Sequences of the symmetric 2-adic complexity of periodic binary sequences is presented based on this observation. We determine the expected value of the 2-adic complexity and derive a lower bound on the expected value of the symmetric 2-adic complexity of periodic binary sequences. Because the 2-adic complex

Self-Help-Group

Dealing

甜瓜

New Sets of Binary and Ternary Sequences with Low Correlationre cyclic shifts of a short sequence or constant columns and whose shift sequence (sequence of column shifts) has the distinct difference property. It is known that a binary m-sequence/GMW sequence of length 2. – 1 can be folded row-by-row into an array of 2. – 1 rows of length 2. + 1. We use this t

Immortal

Improved ,-ary Codes and Sequence Families from Galois Ringsese type of exponential sums provides a lower bound for the minimum distance of a family of codes over ., mostly nonlinear, of length .. and size ., where 1 ≤ . ≤ ... Several families of pairwise cyclically distinct .-ary sequences of period .(.. – 1) of low correlation are also constructed. They co

值得

Quadriphase Sequences Obtained from Binary Quadratic Form Sequencesces. In theory, the construction uses the properties of Galois rings. In this paper, we propose a method for constructing quadriphase sequences using binary sequences based on quadratic forms. The study uses only the properties of Galois fields instead of Galois rings. We demonstrate the theory by c