@inproceedings{3098015,
    title = "New results on the linear complexity of binary sequences",
    author = "Limniotis, Konstantinos and Kolokotronis, Nicholas and Kalouptsidis, and Nicholas",
    year = "2006",
    pages = "2003+",
    publisher = "IEEE Comput. Soc",
    booktitle = "2006 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, VOLS 1-6,
PROCEEDINGS",
    doi = "10.1109/ISIT.2006.261900",
    abstract = "The complexity of binary sequences generated by state-space systems is
studied in this paper via utilization of system theoretic concepts.
Application of controllability and observability conditions lead to a
new block-trace representation of binary sequences enabling the
efficient generation of sequences with maxmium period and linear
complexity. These arguments are also used to study nonlinearly filtered
m-sequences, resulting in a new type of filters that achieve the same
lower bound for the linear complexity as Rueppel’s equidistant filters."
}