These keywords were added by machine and not by the authors. 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. 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. 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. To this end, a new complex- ity measure is defined, called the maximum order complexity. 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.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |