You may have access to the free features available through My Research. You can save searches, save documents, create alerts and more. Please log in through your library or institution to check if you have access.
If you log in through your library or institution you might have access to this article in multiple languages.
Styles include MLA, APA, Chicago and many more. This feature may be available for free if you log in through your library or institution.
You may have access to it for free by logging in through your library or institution.
You may have access to different export options including Google Drive and Microsoft OneDrive and citation management tools like RefWorks and EasyBib. Try logging in through your library or institution to get access to these tools.
When n<2c and the k-error nonlinear complexity is fixed, this paper proves that the number of sequences with length n and nonlinear complexity c is the same as that of the sequences with length n+t and nonlinear complexity c+t (t is any nonnegative integer). For binary sequences with length n and nonlinear complexity c, the numbers of such sequences with k-error nonlinear complexity 1 and 2 can be precisely determined.
