|Title:||An Algorithm for Generating Shift-Register Cycles
|Abstract:||Given two integers n and L, an algorithm to construct binary sequences of length L, such that 1<=L<=2^n and no n-tuple appear twice in a sequence, is given. This algorithm can, be generalized to m-ary sequences, i.e. to construct m-ary sequences of length L, such that 1<=L<=m^n and no n-tuple appears twice in a sequence.|
|Copyright||The above paper is copyright by the Technion, Author(s), or others. Please contact the author(s) for more information|
Remark: Any link to this technical report should be to this page (http://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-info.cgi/1985/CS/CS0366), rather than to the URL of the PDF files directly. The latter URLs may change without notice.
To the list of the CS technical reports of 1985
To the main CS technical reports page
Computer science department, Technion