Abstract
We study the [Formula: see text]-error linear complexity of subsequences of the [Formula: see text]-ary Sidel’nikov sequences over the prime field [Formula: see text]. A general lower bound for the [Formula: see text]-error linear complexity is given. For several special periods, we show that these sequences have large [Formula: see text]-error linear complexity.
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 callMore From: International Journal of Foundations of Computer Science
Disclaimer: 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.
