I. Introduction
The linear complexity of a sequence of terms over a field is defined as the length of the smallest linear recurrence relation which generates that sequence. The -error linear complexity of a periodic sequence is a natural generalisation of the notion of linear complexity and it represents the length of the smallest linear recurrence relation which generates a sequence which differs from the original in at most positions in each period.