Locally-constrained de Bruijn codes: properties, enumeration, code constructions, and applications

• Main Authors: Chee, Yeow Meng, Etzion, Tuvi, Kiah, Han Mao, Marcovich, Sagi, Vardy, Alexander, Vu, Van Khu, Yaakobi, Eitan
• Other Authors: School of Physical and Mathematical Sciences
• Format: Article
• Language: English
• Published: 2022
• Subjects: Engineering::Computer science and engineering; Constrained Codes; Racetrack Memories
• Online Access: https://hdl.handle.net/10356/163774
• Institution: Nanyang Technological University

The de Bruijn graph, its sequences, and their various generalizations, have found many applications in information theory, including many new ones in the last decade. In this paper, motivated by a coding problem for emerging memory technologies, a set of sequences which generalize the window property of de Bruijn sequences, on its shorter subsequences, are defined. These sequences can be also defined and viewed as constrained sequences. Hence, they will be called locally-constrained de Bruijn sequences and a set of such sequences will be called a locally-constrained de Bruijn code. Several properties and alternative definitions for such codes are examined and they are analyzed as generalized sequences in the de Bruijn graph (and its generalization) and as constrained sequences. Various enumeration techniques are used to compute the total number of sequences for any given set of parameters. A construction method of such codes from the theory of shift-register sequences is proposed. Finally, we show how these locally-constrained de Bruijn sequences and codes can be applied in constructions of codes for correcting synchronization errors in the ℓ-symbol read channel and in the racetrack memory channel. For this purpose, these codes are superior in their size to previously known codes.