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

Gal Amram; Yair Ashlagi; Amir Rubin; Yotam Svoray; Moshe Schwartz; Gera Weiss

doi:10.1016/j.disc.2018.09.024

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

Gal Amram, Yair Ashlagi, Amir Rubin, Yotam Svoray, Moshe Schwartz^*, Gera Weiss

^*Corresponding author for this work

Research output: Contribution to journal › Article › peer-review

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.

Original language	English
Pages (from-to)	226-232
Number of pages	7
Journal	Discrete Mathematics
Volume	342
Issue number	1
DOIs	https://doi.org/10.1016/j.disc.2018.09.024
State	Published - Jan 2019
Externally published	Yes

Keywords

De Bruijn sequence
Ford sequence
Prefer-max sequence
Shift rule

Access to Document

10.1016/j.disc.2018.09.024

Cite this

@article{b2a3f607c8384a4e9ef8064875167882,

title = "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.",

keywords = "De Bruijn sequence, Ford sequence, Prefer-max sequence, Shift rule",

author = "Gal Amram and Yair Ashlagi and Amir Rubin and Yotam Svoray and Moshe Schwartz and Gera Weiss",

note = "Publisher Copyright: {\textcopyright} 2018 Elsevier B.V.",

year = "2019",

month = jan,

doi = "10.1016/j.disc.2018.09.024",

language = "אנגלית",

volume = "342",

pages = "226--232",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier",

number = "1",

}

TY - JOUR

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

AU - Amram, Gal

AU - Ashlagi, Yair

AU - Rubin, Amir

AU - Svoray, Yotam

AU - Schwartz, Moshe

AU - Weiss, Gera

PY - 2019/1

Y1 - 2019/1

N2 - 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.

AB - 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.

KW - De Bruijn sequence

KW - Ford sequence

KW - Prefer-max sequence

KW - Shift rule

UR - http://www.scopus.com/inward/record.url?scp=85055106147&partnerID=8YFLogxK

U2 - 10.1016/j.disc.2018.09.024

DO - 10.1016/j.disc.2018.09.024

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:85055106147

SN - 0012-365X

VL - 342

SP - 226

EP - 232

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 1

ER -

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

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this