An algorithm for generating shift-register cycles
type: Item
instance of: scholarly article
title: An algorithm for generating shift-register cycles
zbMATH Open document ID: 0601.94008
DOI: 10.1016/0304-3975(86)90118-0
author: Tuvi Etzion
published in: Theoretical Computer Science
publication date: 1986-01-01T00:00:00Z
review text: This paper deals with an algorithm which, for arbitrary given natural numbers L and n, generates a binary sequence \(S_ L=s_ 0,...,s_{L- 1}\) such that none of its segments of the form \(s_ i,...,s_{i+n-1}\), where \(0\leq i\leq L\) and the subscripts are taken modulo L, appears twice in the sequence. The paper consists of three essential parts: the first one contains a longish explanation of the concept of the algorithm, the second part presents the algorithm, while in the last part its correctness and its time and space complexities are investigated.
Mathematics Subject Classification ID: 94A99
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68R99
Mathematics Subject Classification ID: 94B99
zbMATH DE Number: 3970675
zbMATH Keywords: binary sequence
MaRDI profile type: Publication
full work available at URL: 0304-3975(86)90118-0
OpenAlex ID: W2030684744
cites work: An algorithm for constructing m-ary de Bruijn sequences
cites work: Algorithms for the generation of full-length shift- register sequences
cites work: Q5672651
cites work: A class of nonlinear de Bruijn cycles
cites work: An algebraic construction for q-ary shift register sequences
cites work: m-ary closed sequences
description: scientific article; zbMATH DE number 3970675