A Survey of Full Length Nonlinear Shift Register Cycle Algorithms
From MaRDI portal
Publication:3940837
DOI10.1137/1024041zbMath0482.68033OpenAlexW2007453203MaRDI QIDQ3940837
Publication date: 1982
Published in: SIAM Review (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/1024041
Analysis of algorithms (68W40) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Sequences (mod (m)) (11B50)
Related Items (only showing first 100 items - show all)
An algorithm for generating necklaces of beads in two colors ⋮ On the maximum number of distinct factors of a binary string ⋮ \(n\)-dimensional line digraphs ⋮ On the theorem of Fredricksen and Maiorana about de Bruijn sequences ⋮ Uniform words ⋮ Pattern codification strategies in structured light systems ⋮ Notes on de Bruijn sequences ⋮ On the distribution of characteristic parameters of words ⋮ Multicover Ucycles ⋮ Perfect factors in the de Bruijn graph ⋮ On the nonlinearity of maximum-length NFSR feedbacks ⋮ A novel method for reconstructing period with single input in NFSR ⋮ New constructions for De Bruijn tori ⋮ Cryptographically Strong de Bruijn Sequences with Large Periods ⋮ On the connectivity of the De Bruijn graph ⋮ New classes of perfect maps. I ⋮ The adjacency graphs of FSRs with a class of affine characteristic functions ⋮ The combinatorics of binary arrays ⋮ On the classification of deBruijn sequences ⋮ Constructing de Bruijn sequences by concatenating smaller universal cycles ⋮ The cycle structure of LFSR with arbitrary characteristic polynomial over finite fields ⋮ De-Bruijn sequences and magic ⋮ Characterising the linear complexity of span 1 de Bruijn sequences over finite fields. ⋮ Construction for de Bruijn sequences with large stage ⋮ Stretching de Bruijn sequences ⋮ De Bruijn sequences, irreducible codes and cyclotomy ⋮ Measuring the clustering effect of BWT via RLE ⋮ A new upper bound on the order of affine sub-families of NFSRs ⋮ Generalized Fibonacci recurrences and the lex-least de Bruijn sequence ⋮ Unnamed Item ⋮ Computing generalized de Bruijn sequences ⋮ Computing Minimum Length Representations of Sets of Words of Uniform Length ⋮ On binary de Bruijn sequences from LFSRs with arbitrary characteristic polynomials ⋮ Designing preference functions for de Bruijn sequences with forbidden words ⋮ Generation of full cycles by a composition of NLFSRs ⋮ Properties of the cycles that contain all vectors of weight \(\le k\) ⋮ A relation between sequences generated by Golomb's preference algorithm ⋮ Construction of de Bruijn sequences from product of two irreducible polynomials ⋮ Preliminary results on the minimal polynomial of modified de Bruijn sequences ⋮ Higher-order dangers and precisely constructed taxa in models of randomness ⋮ On extending de Bruijn sequences ⋮ Spans of preference functions for de Bruijn sequences ⋮ On Leaf Node Edge Switchings in Spanning Trees of De Bruijn Graphs ⋮ Unnamed Item ⋮ On ideal \(t\)-tuple distribution of filtering de Bruijn sequence generators ⋮ On the largest affine sub-families of a family of NFSR sequences ⋮ Tight lower bounds on the length of word chains ⋮ An interleaved method for constructing de Bruijn sequences ⋮ Nonsingular Polynomials from Feedback Shift Registers ⋮ Revisiting the prefer-same and prefer-opposite de Bruijn sequence constructions ⋮ Covering the de Bruijn graph ⋮ On the numbers of spanning trees and Eulerian tours in generalized de Bruijn graphs ⋮ The adjacency graphs of some feedback shift registers ⋮ A new look at the de Bruijn graph ⋮ Asymptotically-tight bounds on the number of cycles in generalized de Bruijn-Good graphs ⋮ REPETITIONS, FULLNESS, AND UNIFORMITY IN TWO-DIMENSIONAL WORDS ⋮ On the de Bruijn torus problem ⋮ The discrepancy of the lex-least de Bruijn sequence ⋮ A new linearization method for nonlinear feedback shift registers ⋮ Universal cycles for combinatorial structures ⋮ DE BRUIJN SEQUENCES REVISITED ⋮ The lower bound of the quadratic spans of DeBruijn sequences ⋮ Constructions of de Bruijn sequences from a full-length shift register and an irreducible LFSR ⋮ Generalized de Bruijn graphs ⋮ A state of the art in structured light patterns for surface profilometry ⋮ Generalized de Bruijn graphs ⋮ Test sequence construction using minimum information on the tested system ⋮ An efficiently generated family of binary de Bruijn sequences ⋮ A framework for constructing de Bruijn sequences via simple successor rules ⋮ Decoding structured light patterns for three-dimensional imaging systems ⋮ Approximate Moore graphs are good expanders ⋮ A simple shift rule for \(k\)-ary de Bruijn sequences ⋮ Further results on the equivalence between Galois NFSRs and Fibonacci NFSRs ⋮ Generalized de Bruijn words for primitive words and powers ⋮ Characterizations of generators for modified de Bruijn sequences ⋮ ON THE REPETITIVITY INDEX OF INFINITE WORDS ⋮ Self-dual sequences ⋮ Constructing de Bruijn Sequences Based on a New Necessary Condition ⋮ Clues to the hidden nature of de Bruijn sequences ⋮ A multiple stream generator based on de Bruijn digraph homomorphisms ⋮ Investigating the discrepancy property of de Bruijn sequences ⋮ Longest subsequences shared by two de Bruijn sequences ⋮ On greedy algorithms for binary de Bruijn sequences ⋮ de Bruijn sequences and de Bruijn graphs for a general language ⋮ The directed genus of the de Bruijn graph ⋮ Minimum Eulerian circuits and minimum de Bruijn sequences ⋮ Universal cycles of \((n - 1)\)-partitions of an \(n\)-set ⋮ Storage efficient decoding for a class of binary de Bruijn sequences ⋮ RECIPROCALS OF BINARY POWER SERIES ⋮ A number theoretic view on binary shift registers ⋮ Disordered ground states for classical discrete-state problems in one dimension. ⋮ A recipe for randomness ⋮ Parallel sorting on Cayley graphs ⋮ On the distribution of de Bruijn sequences of low complexity ⋮ Weight class distributions of de Bruijn sequences ⋮ Universal circuit matrix for adjacency graphs of feedback functions ⋮ Maximal state complexity and generalized de Bruijn words ⋮ Decoding perfect maps ⋮ Regular complete permutation polynomials over \(\mathbb{F}_{2^n} \) ⋮ Computing minimum length representations of sets of words of uniform length
This page was built for publication: A Survey of Full Length Nonlinear Shift Register Cycle Algorithms
