An Efficient Shift Rule for the Prefer-Max De Bruijn Sequence Academic Article uri icon

abstract

  • 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. Subjects: Discrete Mathematics (cs. DM) Cite as: arXiv: 1706.01106 [cs. DM](or arXiv: 1706.01106 v1 [cs. DM] for this version) Submission history From: Moshe Schwartz [view email][v1] Sun, 4 Jun 2017 16: 47: 18 GMT (19kb)

publication date

  • January 1, 2017

published in