Constructing Periodic Binary Sequences With Maximum Nonlinear Span

DOI10.1109/TIT.2006.880054MaRDI QIDQ3547999zbMATH OpenFDO

Authors Panagiotis Rizomiliotis

Publication date 21 December 2008

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TIT.2006.880054

Mathematics Subject Classification ID

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

Recommendations

• Results on the Nonlinear Span of Binary Sequences
• Generating good span n sequences using orthogonal functions in nonlinear feedback shift registers
• Binary sequences with period \(N\) and nonlinear complexity \(N - 2\)
• Minimum linear span approximation of binary sequences
• Periodic Binary Sequences: Solved and Unsolved Problems

Cited in

(9)

• Composition of recursions and nonlinear complexity of periodic binary sequences
• Finite length sequences with large nonlinear complexity
• Binary sequences with period \(N\) and nonlinear complexity \(N - 2\)
• Results on the Nonlinear Span of Binary Sequences
• On the Quadratic Span of Binary Sequences
• scientific article; zbMATH DE number 3916170 (Why is no real title available?)
• scientific article; zbMATH DE number 4039793 (Why is no real title available?)
• Generating good span n sequences using orthogonal functions in nonlinear feedback shift registers
• On finite length nonbinary sequences with large nonlinear complexity over the residue ring \(\mathbb{Z}_m\)

This page was built for publication: Constructing Periodic Binary Sequences With Maximum Nonlinear Span

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