An algorithm for computing the error sequence of $$p^{n}$$ p n -periodic binary sequences

Abstract

For binary sequences with period $$p^{n}$$ p n , where $$p$$ p is an odd prime and 2 is a primitive root modulo $$p^{2}$$ p 2 , we present an algorithm which computes the minimum number $$k$$ k so that the $$k$$ k -error linear complexity is not greater than a given constant $$c$$ c . An associated error sequence which gives the $$k$$ k -error linear complexity is also obtained.