Τίτλος:
New results on the linear complexity of binary sequences
Γλώσσες Τεκμηρίου:
Αγγλικά
Περίληψη:
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.
Συγγραφείς:
Limniotis, Konstantinos
Kolokotronis, Nicholas
Kalouptsidis,
Nicholas
Εκδότης:
IEEE Comput. Soc
Τίτλος συνεδρίου:
2006 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, VOLS 1-6,
PROCEEDINGS
DOI:
10.1109/ISIT.2006.261900
