On a class of binary sequences
Neal Zierler · Proceedings of the American Mathematical Society · 1956
Foreword. In certain applications involving digital computing machines one wishes to generate a sequence of 0's and l's with given properties; often the sequence is to be pseudo-random iil a suitable sense. One common way of producing such a sequence is to combine in some fashion a number of given periodic sequences that are stored or generated in the machine. An important class of such sequences consists of those obtained by a time-invariant method of combining given sequences. Our immediate objective is to determine the number of elements of this class if the periods of the original sequences are preassigned and pairwise coprime. To achieve this objective, we examine questions of duplication and periodicity within the class.