In this paper the linear feedback shift registers are determined that can generate the output sequence of two types of clock controlled shift registers suggested by P. Nyffeler. For one type of clock control sufficient conditions are given which guarantee that maximum linear complexity is obtained. Furthermore, it is shown that the randomness properties for sequences of maximal linear complexity depend on clocking procedure.
CITATION STYLE
Smeets, B. (1986). A Note on Sequences Generated by Clock Controlled Shift Registers. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 219 LNCS, pp. 142–148). Springer Verlag. https://doi.org/10.1007/3-540-39805-8_17
Mendeley helps you to discover research relevant for your work.