Abstract
In this paper, we point out a significant difference between the linear complexity and the 2-adic complexity of periodic binary sequences. The concept of the symmetric 2-adic complexity of periodic binary sequences is presented based on this observation. We determine the expected value of the 2-adic complexity and derive a lower bound on the expected value of the symmetric 2-adic complexity of periodic binary sequences. Because the 2-adic complexity of periodic binary sequences is unstable, we present the concepts of the k-error 2-adic complexity and the k-error symmetric 2-adic complexity, and lower bounds on them are also derived.KeywordsPrime NumberBinary SequenceLinear ComplexityStream CipherPeriodic SequenceThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
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.
