@article{2121d227cb5141648442cf06dc818404,
title = "A surprisingly simple de Bruijn sequence construction",
abstract = "Pick any length n binary string b1b2⋯bn and remove the first bit b1. If b2b3⋯bn1 is a necklace, then append the complement of b1 to the end of the remaining string; otherwise append b1. By repeating this process, eventually all 2n binary strings will be visited cyclically. This shift rule leads to a new de Bruijn sequence construction that can be generated in O(1)-amortized time per bit.",
keywords = "CAT algorithm, De Bruijn sequence, Generate, Necklaces, Shift Gray code, Shift rule, Successor rule, Universal cycle",
author = "Joe Sawada and Aaron Williams and Dennis Wong",
note = "Publisher Copyright: {\textcopyright} 2015 Elsevier B.V. All rights reserved.",
year = "2016",
month = jan,
day = "6",
doi = "10.1016/j.disc.2015.08.002",
language = "English",
volume = "339",
pages = "127--131",
journal = "Discrete Mathematics",
issn = "0012-365X",
publisher = "Elsevier",
number = "1",
}