Titlebook: Sequences and their Applications; Proceedings of SETA T. Helleseth,P. V. Kumar,K. Yang Conference proceedings 2002 Springer-Verlag London

罗盘

Description of Binary Sequences Based on the Interval Linear Complexity Profile linear complexity approach to identify corrupted positions of the sequence generated by a linear feedback shift register with known feedback polynomial, where “corruption” of the sequence means either deletion, insertion or inversion of its components.

Brain-Imaging

On Binary Sequences of Period n = pm ∓ 1 with Optimal Autocorrelationutocorrelation in the case of . and . = ±1. Furthermore, we show that they are equivalent to the Lempel-Cohn-Eastman sequence in [2] in the balanced case. We also give a direct proof of the autocorrelation property of the Lempel-Cohn- Eastman sequence and discuss its linear complexity.

显微镜

Neolithic

Uniformly Representable Permutation Polynomialstation. We describe a general technique to confirm the permutation property of such polynomials by algebraic calculations with multivariate polynomials over the two-element field. These computations are simple, but so extensive that they have to be done with computer support. We demonstrate that our

pacific

会议

On the Crosscorrelation of ,-Sequences and Related Sequences with Ideal Autocorrelationthis area. Some families of nonbinary sequences with ideal two-level autocorrelation functions are constructed. Methods for designing sequences of even length with good autocorrelation properties using cyclotomy axe given. In particular, binary sequences of even length with optimal autocorrelation f

FLAX

arthrodesis

Arteriography

BURSA