Titlebook: Sequences and Their Applications - SETA 2010; 6th International Co Claude Carlet,Alexander Pott Conference proceedings 2010 Springer-Verlag

opprobrious

Fortuitous

含沙射影

Lower Bounds on the Average Partial Hamming Correlations of Frequency Hopping Sequences with Low Hit than the period of the chosen frequency hopping sequence, so the study of the partial Hamming correlations of frequency hopping sequences is particularly important. In this paper, the average partial Hamming correlation lower bounds of frequency hopping sequences with low hit zone, with respect to

千篇一律

New Families of Frequency-Hopping Sequences of Length , Derived from the ,-Fold Cyclotomytruct frequency-hopping sequence (FHS) sets by using the properties of the .-fold cycltomy. We give FHS sets with length 2. and frequency set size (. − 1)/., which are optimal with respect to the Peng-Fan bound if . = 1, and near-optimal if . ≥ 2. We also present near-optimal FHS sets with length .

骂人有污点

User-Irrepressible Sequencests from the assigned protocol sequence periodically, and sends a packet whenever the bit is equal to one. It is assumed that any two or more packets overlapping in time result in a collision, and the collided packets are unrecoverable. Due to the lack of feedback and cooperation, there are some rela

水獭

符合规定

Recent Results on Recursive Nonlinear Pseudorandom Number Generatorstion upper bounds on additive character sums which imply uniform distribution results. Moreover, we present lower bounds on the linear complexity profile and closely related lattice tests and thus results on the suitability in cryptography. Finally, we give bounds on multiplicative character sums fr

Mercurial

烦人

On the Autocorrelation and the Linear Complexity of ,-Ary Prime ,-Square Sequencesmine the autocorrelation of the .-ary prime .-square sequences with length .., where . is an odd prime, . is a positive integer and . is a divisor of . − 1. When . is a prime, we also determine the linear complexity of the prime .-square sequences over the prime field ... It is shown that these sequ

Infect

An Improved Approximation Algorithm for Computing the ,-Error Linear Complexity of Sequences Using te DFT (Discrete Fourier Transform) domain, using Blahut’s theorem. We then gave an approximation algorithm of polynomial complexity for the transformed problem by restricting the search space to error sequences whose DFT have period up to .. However, when applying the inverse transformation, the err