Abstract
For multisequences there are various possibilities of defining analogs of the k-error linear complexity of single sequences. We consider the k-error joint linear complexity, the k-error F q -linear complexity, and the k → -error joint linear complexity. Improving the existing results, several results on the existence of, and lower bounds on the number of, multisequences with large error linear complexity are obtained. Improved lower bounds are shown for the case of prime-power periodic multisequences. An asymptotic analysis for the prime-power period case is carried out.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.