Notes on de Bruijn sequences
type: Item
instance of: scholarly article
title: Notes on de Bruijn sequences
zbMATH Open document ID: 0619.68061
DOI: 10.1016/0166-218X(87)90072-2
author: Shenquan Xie
published in: Discrete Applied Mathematics
publication date: 1987-01-01T00:00:00Z
review text: In this paper the concepts of look-up table, look-up table labels and mini-cycle set are introduced and used to present some algorithms for generating the greatest de Bruijn sequence DB(m,n) and all DB(m,n)'s. Also these algorithms are compared with the Martin algorithm and backtracking algorithms. In the appendix an algorithm for numerically generating r arrangements of n objects is presented.
Mathematics Subject Classification ID: 68R99
Mathematics Subject Classification ID: 05A99
zbMATH DE Number: 4005633
zbMATH Keywords: look-up table
zbMATH Keywords: look-up table labels
zbMATH Keywords: mini-cycle set
zbMATH Keywords: algorithms
zbMATH Keywords: greatest de Bruijn sequence
MaRDI profile type: Publication
cites work: De Bruijn Sequences-A Model Example of the Interaction of Discrete Mathematics and Computer Science
cites work: A Survey of Full Length Nonlinear Shift Register Cycle Algorithms
description: scientific article; zbMATH DE number 4005633