Computing the m-Tight Error Linear Complexity of Periodic Binary Sequences

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_m, LC_m, 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ⁿ is given, where p is a prime and 2 is a primitive root modulo p².