On the Classification of Periodic Binary Sequences into Nonlinear Complexity Classes

DOI10.1007/11863854_18MaRDI QIDQ3541923zbMATH OpenOpenAlexFDO

Authors George Petrides, Johannes Mykkeltveit

Publication date 27 November 2008

Published in Sequences and Their Applications – SETA 2006 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11863854_18

zbMATH Keywords

nonlinear complexitynonlinear feedback shift registershort cycles

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)

Recommendations

• Composition of recursions and nonlinear complexity of periodic binary sequences
• Binary sequences with period \(N\) and nonlinear complexity \(N - 2\)
• On the linear complexity of nonlinearly filtered pn-sequences
• On the cycle structure of some nonlinear shift register sequences
• A Survey of Full Length Nonlinear Shift Register Cycle Algorithms

Cited in

(6)

• Composition of recursions and nonlinear complexity of periodic binary sequences
• Binary sequences with period \(N\) and nonlinear complexity \(N - 2\)
• Classifying non-periodic sequences by permutation transducers
• Asymptotic Behavior of Normalized Linear Complexity of Ultimately Nonperiodic Binary Sequences
• On finite length nonbinary sequences with large nonlinear complexity over the residue ring \(\mathbb{Z}_m\)
• Revisiting the relationship between compositional sequence complexity and periodicity

This page was built for publication: On the Classification of Periodic Binary Sequences into Nonlinear Complexity Classes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3541923)