A recursive construction of nonbinary de Bruijn sequences

DOI10.1007/s10623-010-9423-7zbMath1227.68080arXiv0812.4012OpenAlexW1998517951MaRDI QIDQ543426

Abbas Alhakim, Mufutau Akinwande

Publication date: 17 June 2011

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0812.4012

zbMATH Keywords

recursive constructiongraph homomorphismde Bruijn sequenceLempel's \(D\)-morphism

Mathematics Subject Classification ID

General topics of discrete mathematics in relation to computer science (68R01) Graph theory (including graph drawing) in computer science (68R10) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20)

Related Items

Efficient Design of Compact Unstructured RNA Libraries Covering All k-mers, The adjacency graphs of FSRs with a class of affine characteristic functions, Construction for de Bruijn sequences with large stage, Stretching de Bruijn sequences, Preliminary results on the minimal polynomial of modified de Bruijn sequences, On ideal \(t\)-tuple distribution of filtering de Bruijn sequence generators, An interleaved method for constructing de Bruijn sequences

Cites Work

• Feedback shift registers
• On the complexities of de-Bruijn sequences
• Construction of de Bruijn sequences of minimal complexity
• An efficient implementation of the D-homomorphism for generation of de Bruijn sequences
• On a Homomorphism of the de Bruijn Graph and its Applications to the Design of Feedback Shift Registers
• Regular Sequences and Frequency Distributions