Linear complexity profile and correlation measure of interleaved sequences

DOI10.1007/s12095-015-0131-zzbMath1343.94033OpenAlexW1985780997MaRDI QIDQ892510

Daniel Panario, Jing Jane He, Qiang Wang, Arne Winterhof

Publication date: 19 November 2015

Published in: Cryptography and Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12095-015-0131-z

zbMATH Keywords

linear complexity profileLegendre sequencescorrelation measuresinterleaved sequences

Mathematics Subject Classification ID

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

On the \(N\)th linear complexity of automatic sequences

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Linear complexity profile of \(m\)-ary pseudorandom sequences with small correlation measure
• Cryptographic applications of analytic number theory. Complexity lower bounds and pseudo\-randomness
• On finite pseudorandom sequences of \(k\) symbols.
• Linear complexity profile of binary sequences with small correlation measure
• On finite pseudorandom binary sequences I: Measure of pseudorandomness, the Legendre symbol
• New designs for signal sets with low cross correlation, balance property, and large linear span: GF(p) case
• Theory and applications of q-ary interleaved sequences

This page was built for publication: Linear complexity profile and correlation measure of interleaved sequences