Linear complexity profile of binary sequences with small correlation measure
From MaRDI portal
Publication:2466313
DOI10.1007/s10998-006-0008-1zbMath1127.11050OpenAlexW2003906679MaRDI QIDQ2466313
Nina Brandstätter, Arne Winterhof
Publication date: 14 January 2008
Published in: Periodica Mathematica Hungarica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10998-006-0008-1
Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60) Well-distributed sequences and other variations (11K36)
Related Items (19)
On pseudorandom binary sequences constructed by using finite fields ⋮ Measures of Pseudorandomness: Arithmetic Autocorrelation and Correlation Measure ⋮ On the linear complexity of binary lattices ⋮ On discrete Fourier transform, ambiguity, and Hamming-autocorrelation of pseudorandom sequences ⋮ Linear complexity profile and correlation measure of interleaved sequences ⋮ Construction of pseudorandom binary sequences using additive characters over \(GF(2^k)\). II ⋮ Linear complexity profile of \(m\)-ary pseudorandom sequences with small correlation measure ⋮ Multiplicative character sums of Fermat quotients and pseudorandom sequences ⋮ On the Structure of Inversive Pseudorandom Number Generators ⋮ On lattice profile of the elliptic curve linear congruential generators ⋮ On the \(N\)th linear complexity of automatic sequences ⋮ Perfect linear complexity profile and apwenian sequences ⋮ On the pseudorandomness of binary and quaternary sequences linked by the Gray mapping ⋮ Hamming correlation of higher order ⋮ A family of elliptic curve pseudorandom binary sequences ⋮ Correlation measure, linear complexity and maximum order complexity for families of binary sequences ⋮ Modified constructions of binary sequences using multiplicative inverse ⋮ Construction of pseudorandom binary sequences using additive characters over \(GF(2^k)\) ⋮ Improving results on the pseudorandomness of sequences generated via the additive order of a finite field
This page was built for publication: Linear complexity profile of binary sequences with small correlation measure
