On the complexities of de-Bruijn sequences

DOI10.1016/0097-3165(82)90038-3MaRDI QIDQ1836666zbMATH OpenOpenAlexFDO

Authors A. H. Chan, Richard A. Games, Edwin L. Key

Publication date 1982

Published in Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0097-3165(82)90038-3

zbMATH Keywords

binary de- Bruijn sequencedistribution of the complexitiesshortest linear recursion

Mathematics Subject Classification ID

Enumerative combinatorics (05A99) Sequences and sets (11B99)

Cites work

• scientific article; zbMATH DE number 3427210 (Why is no real title available?)
• scientific article; zbMATH DE number 3422259 (Why is no real title available?)
• scientific article; zbMATH DE number 3095523 (Why is no real title available?)
• An analysis of the structure and complexity of nonlinear binary sequence generators
• Generation of some de Bruijn sequences
• Normal Recurring Decimals
• On a Homomorphism of the de Bruijn Graph and its Applications to the Design of Feedback Shift Registers
• On the Complexity of Finite Sequences
• On the cycle structure of some nonlinear shift register sequences
• Shift-register synthesis and BCH decoding
• The definition of random sequences

Cited in

(28)

• Characterizations of generators for modified de Bruijn sequences
• Roulette games and depths of words over finite commutative rings
• A generalization of de Bruijn graphs and classification of endomorphisms of Cuntz algebras by graph invariants
• Preliminary results on the minimal polynomial of modified de Bruijn sequences
• A recursive construction of nonbinary de Bruijn sequences
• Graphs with the unique path property: Structure, cycles, factors, and constructions
• Asymptotically-tight bounds on the number of cycles in generalized de Bruijn-Good graphs
• Minimal polynomials of the modified de Bruijn sequences
• Spans of preference functions for de Bruijn sequences
• Perfect factors in the de Bruijn graph
• Cryptographically Strong de Bruijn Sequences with Large Periods
• Characterising the linear complexity of span 1 de Bruijn sequences over finite fields.
• Minimal Polynomials of the Modified de Bruijn Sequences
• The combinatorics of binary arrays
• Clues to the hidden nature of de Bruijn sequences
• Randomness and Representation of Span n Sequences
• On the \(k\)-error linear complexities of De Bruijn sequences
• Longest subsequences shared by two de Bruijn sequences
• A new upper bound on the order of affine sub-families of NFSRs
• Further results on correlation functions of de Bruijn sequences
• On the minimum linear complexity of de Bruijn sequences over non-prime finite fields
• Weight class distributions of de Bruijn sequences
• On the distribution of de Bruijn sequences of low complexity
• On ideal \(t\)-tuple distribution of filtering de Bruijn sequence generators
• Construction of de Bruijn sequences from product of two irreducible polynomials
• There are no de Bruijn sequences of span \(n\) with complexity \(2^{n- 1}+n+1\)
• On evaluating the linear complexity of a sequence of least period \(2^ n\)
• On ideal \(t\)-tuple distribution of orthogonal functions in filtering de Bruijn generators

This page was built for publication: On the complexities of de-Bruijn sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1836666)