Composition of recursions and nonlinear complexity of periodic binary sequences

DOI10.1007/s10623-008-9178-6zbMath1179.94057OpenAlexW2059196463MaRDI QIDQ1009065

George Petrides, Johannes Mykkeltveit

Publication date: 31 March 2009

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-008-9178-6

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)

Related Items

Binary sequences with period \(N\) and nonlinear complexity \(N - 2\)

Cites Work

• Unnamed Item
• An approximate distribution for the maximum order complexity
• Nonlinear Complexity of Binary Sequences and Connections with Lempel-Ziv Compression
• On the Classification of Periodic Binary Sequences into Nonlinear Complexity Classes
• Results on the Nonlinear Span of Binary Sequences
• Constructing Periodic Binary Sequences With Maximum Nonlinear Span