论文信息 - Distribution of r-Patterns in the Most Significant Bit of a Maximum Length Sequence over - 字舞流文

Distribution of r-Patterns in the Most Significant Bit of a Maximum Length Sequence over

The number of subwords of length r and of given value within a period of a sequence in the title is shown to be close to equidistribution. Important tools in the proof are a higher order correlation and Galois ring character sum estimates.

Patrick Solé | Dmitrii Zinoviev

[1] Zongduo Dai,et al. Binary sequences derived from ML-sequences over rings I: Periods and minimal polynomials , 1992, Journal of Cryptology.

[2] Patrick Solé,et al. The Most Significant Bit of Maximum-Length Sequences Over BBZ2l: Autocorrelation and Imbalance , 2004, IEEE Trans. Inf. Theory.

[3] A. Robert Calderbank,et al. An upper bound for Weft exponential sums over Galois tings and applications , 1994, IEEE Trans. Inf. Theory.

[4] Jyrki Lahtonen,et al. On the odd and the aperiodic correlation properties of the Kasami sequences , 1995, IEEE Trans. Inf. Theory.

[5] Wenbao Han,et al. Random properties of the highest level sequences of primitive sequences over Z(2e) , 2003, IEEE Trans. Inf. Theory.

[6] Patrick Solé,et al. Z8-Kerdock codes and pseudorandom binary sequences , 2004, J. Complex..

[7] Tor Helleseth,et al. An Expansion for the Coordinates of the Trace Function over Galois Rings , 1997, Applicable Algebra in Engineering, Communication and Computing.

[8] H. Davenport. Multiplicative Number Theory , 1967 .

[9] Ping Wang,et al. Distribution of R-Patterns in the Highest Level of P-Adic Expansion of Some Linear Recursion Sequences Over Galois Rings , 2003 .