Minimum linear span approximation of binary sequences

Author

Kolokotronis, Nicholas ; Rizomiliotis, Panagiotis ; Kalouptsidis, Nicholas

Author_Institution

Dept. of Informatics & Telecommun., Nat. & Kapodistrian Univ. of Athens, Greece

Volume

48

Issue

10

fYear

2002

fDate

10/1/2002 12:00:00 AM

Firstpage

2758

Lastpage

2764

Abstract

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

Keywords

approximation theory; binary sequences; computational complexity; synchronisation; Fourier series; binary sequences; characteristic phase; congruential equations method; cryptography; cyclic equivalence; high-level algorithm; linear span; minimum linear span approximation; minimum linear span sequence; periodic sequence; phase synchronization method; robustness; sequence characterization; sequence design; sequential divisions method; trace representation; Autocorrelation; Binary sequences; Context; Cryptography; Equations; Guidelines; Linear approximation; Polynomials; Signal processing algorithms; Vectors;

fLanguage

English

Journal_Title

Information Theory, IEEE Transactions on

Publisher

ieee

ISSN

0018-9448

Type

jour

DOI

10.1109/TIT.2002.802621

Filename

1035126