Abstract
Based on the earlier notions of linear complexity, k-error linear linear complexity, k-error linear complexity profile and minerror, the concept of m-tight error linear complexity is presented to study the linear complexity stability of sequences. The m-tight error linear complexity of sequence S is defined as a two tuple k <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">m</sub> , LC <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">m</sub> , which is the mth jump point of the k-error linear complexity profile of sequence S. Based on the Wang-Zhang-Xiao algorithm, an efficient algorithm for computing m-tight error linear complexity of binary sequences with period p <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">n</sup> is given, where p is a prime and 2 is a primitive root modulo p <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup> .
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.
