On the error linear complexity spectrum of %$p^{n}%$-periodic binary sequences

Abstract The error linear complexity spectrum of a periodic sequence is defined to be the ordered list of %$k%$-error linear complexities of the sequence. In this paper, we present an algorithm which computes the error linear complexity spectrum for binary sequences with period %$p^{n}%$, where %$p%...
Ausführliche Beschreibung

Abstract The error linear complexity spectrum of a periodic sequence is defined to be the ordered list of %$k%$-error linear complexities of the sequence. In this paper, we present an algorithm which computes the error linear complexity spectrum for binary sequences with period %$p^{n}%$, where %$p%$ is an odd prime and %$2%$ is a primitive root modulo %$p^{2}%$. Ausführliche Beschreibung