Minimum linear span approximation of binary sequences

The determination of the minimum linear span sequence that differs from a given binary sequence, of period N = 2 n - 1, by at most one digit is discussed and three methods are presented: the sequential divisions method, the congruential equations method, and the phase synchronization method. High-level algorithm organizations are provided. Finally, guidelines on sequence characterization and design via the notion of robustness are given