|| Balanced de Bruijn Sequences
||Sagi Marcovich, Tuvi Etzion, Eitan Yaakobi, Technion-Israel Institute of Technology, Israel|
||D4-S1-T2: Sequences I
||Thursday, 15 July, 22:00 - 22:20
||Thursday, 15 July, 22:20 - 22:40
The de Bruijn graph and its sequences have found many diverse applications in information theory as well as other areas of computer science and engineering such as interconnection networks, VLSI decomposition, and most recently in DNA storage. Binary balanced sequences have also been a subject to a large research during the last forty years with various applications and a lot of interest in information theory. There have been some works on classification of balanced sequences mainly based on their spectral-null order. This work generalizes the concept of de Bruijn sequences, based on the de Bruijn graph of order $ \ell $, where each edge is multiplied to a fixed number of multiple edges. This implies that in the sequences derived from the generalized graph each $ \ell $-tuple has the same multiplicity. Using this generalization we form an interesting hierarchy between balanced sequences. Furthermore, another hierarchy is given by the derivatives of balanced sequences. Enumeration for each such family of sequences and efficient encoding and decoding algorithms are also provided.