Minimum linear span approximation of binary sequences

Authors:
N. Kolokotronis;P. Rizomiliotis;N. Kalouptsidis
Affiliations:
Dept. of Informatics & Telecommun., Nat. & Kapodistrian Univ. of Athens;-;-
Venue:
IEEE Transactions on Information Theory
Year:
2006

Citing 0
Cited 2

Properties of the error linear complexity spectrum

IEEE Transactions on Information Theory
New results on periodic sequences with large k-error linear complexity

IEEE Transactions on Information Theory

Quantified Score

Hi-index	754.96

Visualization

Abstract

The determination of the minimum linear span sequence that differs from a given binary sequence, of period N=2n-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.