A class of nonlinear de Bruijn cycles

DOI10.1016/S0097-3165(75)80007-0zbMath0311.05007MaRDI QIDQ1219284

Harold Fredricksen

Publication date: 1975

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

Mathematics Subject Classification ID

Enumerative combinatorics (05A99) Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Algorithms in computer science (68W99)

Related Items

An algorithm for generating shift-register cycles ⋮ An algorithm for generating necklaces of beads in two colors ⋮ Cryptographically Strong de Bruijn Sequences with Large Periods ⋮ Generalizing the classic greedy and necklace constructions of de Bruijn sequences and universal cycles ⋮ Construction for de Bruijn sequences with large stage ⋮ On binary de Bruijn sequences from LFSRs with arbitrary characteristic polynomials ⋮ Generation of full cycles by a composition of NLFSRs ⋮ Properties of the cycles that contain all vectors of weight \(\le k\) ⋮ Generation of some de Bruijn sequences ⋮ Construction of de Bruijn sequences from product of two irreducible polynomials ⋮ An interleaved method for constructing de Bruijn sequences ⋮ A surprisingly simple de Bruijn sequence construction ⋮ The adjacency graphs of some feedback shift registers ⋮ A new look at the de Bruijn graph ⋮ On the de Bruijn torus problem ⋮ Lexicographic compositions and de Bruijn sequences ⋮ On some classes of nonlinear shift registers with the same cyclic structure ⋮ A simple shift rule for \(k\)-ary de Bruijn sequences ⋮ Clues to the hidden nature of de Bruijn sequences ⋮ Longest subsequences shared by two de Bruijn sequences ⋮ On greedy algorithms for binary de Bruijn sequences

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Constructive theorems for the truth table of the Ford sequence
• Generation of the Ford sequence of length \(2^ n\), n large
• Generating and Counting the Double Adjacencies in a Pure Circulating Shift Register
• A problem in arrangements
• The lexicographically least de Bruijn cycle
• On a Homomorphism of the de Bruijn Graph and its Applications to the Design of Feedback Shift Registers
• Double Adjacencies Between Cycles of a Circulating Shift Register
• Regular Sequences and Frequency Distributions
• Normal Recurring Decimals
• Note on a Paper By I. J. Good