Distribution of r-Patterns in the Most Significant Bit of a Maximum Length Sequence over ${\mathbb Z}_{2^l}$

DOI10.1007/11423461_20zbMath1145.94427OpenAlexW1276098905MaRDI QIDQ5450834

Patrick Solé, Dmitrii Zinoviev

Publication date: 14 March 2008

Published in: Sequences and Their Applications - SETA 2004 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11423461_20

zbMATH Keywords

Galois RingsHigher Order CorrelationMaximum Length SequencesMost Significant Bit

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)

Related Items (4)

Estimating the number of solutions of systems of nonlinear equations with linear recurring arguments by the spectral method ⋮ Equidistributed sequences over finite fields produced by one class of linear recurring sequences over residue rings ⋮ Метод тригонометрических сумм для исследования частот $r$-грамм в старших координатных последовательностях линейных рекуррент над кольцом $\mathbb{Z}_{2^n}$ ⋮ Коэффициенты кросс-корреляции разрядных последовательностей равномерных линейных рекуррент над примарным кольцом вычетов

This page was built for publication: Distribution of r-Patterns in the Most Significant Bit of a Maximum Length Sequence over ${\mathbb Z}_{2^l}$