An efficient shift rule for the prefer-max De...

An efficient shift rule for the prefer-max De Bruijn sequence

Abstract

A shift rule for the prefer-max De Bruijn sequence is formulated, for all sequence orders, and over any finite alphabet. An efficient algorithm for this shift rule is presented, which has linear (in the sequence order) time and memory complexity.

Authors

Amram G; Ashlagi Y; Rubin A; Svoray Y; Schwartz M; Weiss G

Journal

Discrete Mathematics, Vol. 342, No. 1, pp. 226–232

Publisher

Elsevier

Publication Date

January 1, 2019

DOI

10.1016/j.disc.2018.09.024

ISSN

0012-365X

Associated Experts

Moshe Schwartz

Professor, Faculty of Engineering

Visit profile

Labels

Fields of Research (FoR)

4901 Applied mathematics 49 Mathematical Sciences 4904 Pure mathematics

View published work (Non-McMaster Users)

View published work (McMaster Users)

Contact the Experts team

Get technical help

Provide website feedback