The Most Significant Bit of Maximum-Length Sequences Over<tex>$BBZ_2^l$</tex>: Autocorrelation and Imbalance
From MaRDI portal
Publication:3547646
DOI10.1109/TIT.2004.831858zbMath1301.94129MaRDI QIDQ3547646
Dmitrii Zinoviev, Patrick Solé
Publication date: 21 December 2008
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60)
Related Items (10)
Estimating the number of solutions of systems of nonlinear equations with linear recurring arguments by the spectral method ⋮ Injectivity of compressing maps on the set of primitive sequences modulo square-free odd integers ⋮ The Sidel'nikov method for estimating the number of signs on segments of linear recurrence sequences over Galois rings ⋮ On the distinctness of modular reductions of primitive sequences over \(\mathbb Z/(2^{32}-1)\) ⋮ On the distinctness of modular reductions of primitive sequences modulo square-free odd integers ⋮ Equidistributed sequences over finite fields produced by one class of linear recurring sequences over residue rings ⋮ The Peak to Sidelobe Level of the Most Significant Bit of Trace Codes over Galois Rings ⋮ Galois Rings and Pseudo-random Sequences ⋮ Метод тригонометрических сумм для исследования частот $r$-грамм в старших координатных последовательностях линейных рекуррент над кольцом $\mathbb{Z}_{2^n}$ ⋮ Коэффициенты кросс-корреляции разрядных последовательностей равномерных линейных рекуррент над примарным кольцом вычетов
This page was built for publication: The Most Significant Bit of Maximum-Length Sequences Over<tex>$BBZ_2^l$</tex>: Autocorrelation and Imbalance
