Construction of de Bruijn sequences of minimal complexity

DOI10.1109/TIT.1984.1056965zbMath0576.94023OpenAlexW2079556185MaRDI QIDQ3698698

Tuvi Etzion, Abraham Lempel

Publication date: 1984

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.1984.1056965

zbMATH Keywords

linear complexity

Mathematics Subject Classification ID

Enumerative combinatorics (05A99) Theory of error-correcting codes and error-detecting codes (94B99) Sequences and sets (11B99)

Related Items (14)

Perfect factors in the de Bruijn graph ⋮ Cryptographically Strong de Bruijn Sequences with Large Periods ⋮ Constructing de Bruijn sequences by concatenating smaller universal cycles ⋮ Graphs with the unique path property: Structure, cycles, factors, and constructions ⋮ Preliminary results on the minimal polynomial of modified de Bruijn sequences ⋮ Minimal polynomials of the modified de Bruijn sequences ⋮ A recursive construction of nonbinary de Bruijn sequences ⋮ Randomness and Representation of Span n Sequences ⋮ On some classes of nonlinear shift registers with the same cyclic structure ⋮ On the \(k\)-error linear complexities of De Bruijn sequences ⋮ Self-dual sequences ⋮ On the minimum linear complexity of de Bruijn sequences over non-prime finite fields ⋮ Longest subsequences shared by two de Bruijn sequences ⋮ Minimal Polynomials of the Modified de Bruijn Sequences

This page was built for publication: Construction of de Bruijn sequences of minimal complexity