TY - CONF
TI - New results on the linear complexity of binary sequences
AU - Limniotis, Konstantinos
AU - Kolokotronis, Nicholas
AU - Kalouptsidis,
AU - Nicholas
PY - 2006
SP - 2003+
PB - IEEE Comput. Soc
T2 - 2006 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, VOLS 1-6,
PROCEEDINGS
TODO - 10.1109/ISIT.2006.261900
TODO - null
TODO - 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.
ER -