The shortest feedback shift register that can generate a given sequence

34Citations
Citations of this article
41Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In this paper the problem of finding the absolutely shortest (possibly nonlin-ear) feedback shift register, which can generate a given sequence with characters from some arbitrary finite alphabet, is considered. To this end, a new complex-ity measure is defined, called the maximum order complexity. A new theory of the nonlinear feedback shift register is developed, concerning elementary complexity properties of transposed and reciprocal sequences, and feedback functions of the maximum order feedback shift register equivalent. Moreover, Blumer’s algorithm is identified as a powerful tool for determining the maxi-mum order complexity profile of sequences, as well as their period, in linear time and memory. The typical behaviour of the maximum order complexity profile is shown and the consequences for the analysis of given sequences and the synthesis of feedback shift registers are discussed.

Cite

CITATION STYLE

APA

Jansen, C. J. A., & Boekee, D. E. (1990). The shortest feedback shift register that can generate a given sequence. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 435 LNCS, pp. 90–99). Springer Verlag. https://doi.org/10.1007/0-387-34805-0_10

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free