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

换话题

不可知论

New Families of ,-Ary Sequences from Quadratic Form with Low Correlation and Large Linear Spanto transform the problem of computing exponential sums into determining the weights of certain quadratic forms. We use this idea to define two new families of non-binary sequences and determine their correlation properties. The new families of sequences possess low correlation and large linear complexity properties.

使成波状

最小

Univariate and Multivariate Merit Factorsed via quantum error correcting codes tend to maximise Clifford merit factor. Results are presented as to the distribution of the above merit factors over the set of binary sequences and Boolean functions.

Allowance

On the Computation of the Linear Complexity and the ,-Error Linear Complexity of Binary Sequences wiviewed as initial segments of infinite sequences with period a power of two. Lauder and Paterson apply their algorithm to decoding binary repeated-root cyclic codes of length ℓ = 2. in . time. We improve on their result, developing a decoding algorithm with . bit complexity.

相互影响

New Sets of Binary and Ternary Sequences with Low Correlatione columns of the array can be multiplied by binary orthogonal sequences of commensurate length to produce a set of arrays with low cross-correlation. These arrays are unfolded to produce sequence sets with identical low correlation.

atrophy

A Survey of the Merit Factor Problem for Binary Sequences aperiodic autocorrelations are collectively small according to some suitable measure. The merit factor is an important such measure, and the problem of determining the best value of the merit factor of long binary sequences has resisted decades of attack by mathematicians and communications enginee

偶像

Generator

抛射物

Discrete Fourier Transform, Joint Linear Complexity and Generalized Joint Linear Complexity of Multisfy simultaneously. Since the .-linear spaces . and . are isomorphic, a multisequence can also be identified with a single sequence . having its terms in the extension field .. The linear complexity . of ., i.e. the length of the shortest recurrence relation with coefficients in . that . satisfies,