Abstract
In this paper, periodic sequences with period N and nonlinear complexity N − 2 are investigated. A necessary and sufficient condition for characterizing such sequences is established, and a recursive method is proposed to generate all possible binary sequences with period N and nonlinear complexity N − 2. The exact number of such sequences is also determined.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
