The linear complexity and the $k$-error linear complexity of a sequence have
been used as important security measures for key stream sequence strength in
linear feedback shift register design. By studying the linear complexity of
binary sequences with period $2^n$, one could convert the computation of
$k$-error linear complexity into finding error sequences with minimal Hamming
weight.