On the public citation graph
A Survey of Full Length Nonlinear Shift Register Cycle Algorithms
0 signed · 434 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/andp.18471481202openalex-snapshot
Ueber die Auflösung der Gleichungen, auf welche man bei der Untersuchung der linearen Vertheilung galvanischer Ströme geführt wird
inferredcites →https://doi.org/10.1007/bfb0057319openalex-snapshot
Combinatorial Theory Seminar Eindhoven University of Technology
inferredcites →https://doi.org/10.1016/0012-365x(78)90002-xopenalex-snapshot
Necklaces of beads in k colors and k-ary de Bruijn sequences
inferredcites →https://doi.org/10.1016/0097-3165(71)90012-4openalex-snapshot
Constructive theorems for the truth table of the ford sequence
inferredcites →https://doi.org/10.1016/0097-3165(72)90091-xopenalex-snapshot
Generation of the ford sequence of length 2n, n large
inferredcites →https://doi.org/10.1016/0097-3165(77)90059-0openalex-snapshot
Lexicographic compositions and deBruijn sequences
inferredcites →https://doi.org/10.1016/0097-3165(82)90038-3openalex-snapshot
On the complexities of de Bruijn sequences
inferredcites →https://doi.org/10.1016/0196-6774(81)90007-9openalex-snapshot
A new memoryless algorithm for de Bruijn sequences
inferredcites →https://doi.org/10.1016/s0019-9958(68)90973-xopenalex-snapshot
On primitive trinomials (Mod 2)
inferredcites →https://doi.org/10.1016/s0019-9958(69)90356-8openalex-snapshot
On primitive trinomials (mod 2), II
inferredcites →https://doi.org/10.1016/s0019-9958(69)90631-7openalex-snapshot
Primitive trinomials whose degree is a Mersenne exponent
inferredcites →https://doi.org/10.1016/s0021-9800(70)80050-3openalex-snapshot
The lexicographically least de Bruijn cycle
inferredcites →https://doi.org/10.1016/s0097-3165(75)80007-0openalex-snapshot
A class of nonlinear de Bruijn cycles
inferredcites →https://doi.org/10.1038/scientificamerican0561-148openalex-snapshot
The Mathematician as an Explorer
inferredcites →https://doi.org/10.1080/00029890.1941.11991103openalex-snapshot
On Unicursal Paths in a Network of Degree 4
inferredcites →https://doi.org/10.1080/00029890.1971.11992920openalex-snapshot
Permutations Arranged Around a Circle
inferredcites →https://doi.org/10.1080/00401706.1961.10489978openalex-snapshot
Error Correcting Codes
inferredcites →https://doi.org/10.1090/s0002-9904-1934-05988-3openalex-snapshot
A problem in arrangements
inferredcites →https://doi.org/10.1090/s0002-9939-1960-0123351-1openalex-snapshot
Regular Sequences and Frequency Distributions
inferredcites →https://doi.org/10.1109/pgec.1966.264498openalex-snapshot
Relations Between P n Cycles and Stable Feedback Shift Registers
inferredcites →https://doi.org/10.1109/proc.1965.4233openalex-snapshot
Digital communications with space applications
inferredcites →https://doi.org/10.1109/t-c.1970.222859openalex-snapshot
On a Homomorphism of the de Bruijn Graph and its Applications to the Design of Feedback Shift Registers
inferredcites →https://doi.org/10.1109/t-c.1973.223622openalex-snapshot
Double Adjacencies Between Cycles of a Circulating Shift Register
inferredcites →https://doi.org/10.1109/t-c.1975.224210openalex-snapshot
Generating and Counting the Double Adjacencies in a Pure Circulating Shift Register
inferredcites →https://doi.org/10.1112/jlms/s1-21.3.169openalex-snapshot
Note on a Paper By I. J. Good
inferredcites →https://doi.org/10.1137/0130017openalex-snapshot
Matrix Generalizations of Some Theorems on Trees, Cycles and Cocycles in Graphs
inferredcites →https://doi.org/10.1145/321406.321415openalex-snapshot
An Algorithm for Generating Stable Feedback Shift Registers of Order n
inferredcites →https://doi.org/10.1214/aoms/1177706795openalex-snapshot
Exact Markov Probabilities from Oriented Linear Graphs
inferredcites →https://doi.org/10.4064/aa-28-4-349-361openalex-snapshot
Normal recurring decimals, normal periodic systems, (j,ε) - normality, and normal numbers
inferredcites →https://doi.org/10.4153/cjm-1966-026-4openalex-snapshot
The Number of Circular Patterns Compatible with a Pseudo-Symmetric Connected Graph
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/0471219282.eot328openalex-snapshot
Feedback Shift Register Sequences
inferred← citeshttps://doi.org/10.1002/jgt.23007openalex-snapshot
Graphs with the unique path property: Structure, cycles, factors, and constructions
inferred← citeshttps://doi.org/10.1002/rsa.20033openalex-snapshot
De Bruijn cycles for covering codes
inferred← citeshttps://doi.org/10.1006/eujc.1997.0183openalex-snapshot
The Spectrum of de Bruijn and Kautz Graphs
inferred← citeshttps://doi.org/10.1006/jcta.1996.0088openalex-snapshot
Permutation Polynomials, de Bruijn Sequences, and Linear Complexity
inferred← citeshttps://doi.org/10.1006/jcta.1996.0102openalex-snapshot
On the Existence of de Bruijn Tori with Two by Two Windows
inferred← citeshttps://doi.org/10.1006/jcta.1997.2822openalex-snapshot
Characterising the Linear Complexity of Span 1 de Bruijn Sequences over Finite Fields
inferred← citeshttps://doi.org/10.1007/0-387-34799-2_33openalex-snapshot
Aperiodic Linear Complexities of de Bruijn Sequences
inferred← citeshttps://doi.org/10.1007/0-387-34805-0_10openalex-snapshot
The Shortest Feedback Shift Register That Can Generate A Given Sequence
inferred← citeshttps://doi.org/10.1007/0-387-34805-0_9openalex-snapshot
On the Quadratic Spans of Periodic Sequences
inferred← citeshttps://doi.org/10.1007/11535294_12openalex-snapshot
Systolic Routing in an Optical Butterfly
inferred← citeshttps://doi.org/10.1007/11576235_53openalex-snapshot
Systolic Routing in an Optical Fat Tree
inferred← citeshttps://doi.org/10.1007/3-540-45961-8_29openalex-snapshot
A New Class of Nonlinear Functions for Running-key Generators
inferred← citeshttps://doi.org/10.1007/3-540-46416-6_13openalex-snapshot
The Maximum Order Complexity of Sequence Ensembles
inferred← citeshttps://doi.org/10.1007/3-540-46513-8_3openalex-snapshot
Elliptic Curve Pseudorandom Sequence Generators
inferred← citeshttps://doi.org/10.1007/3-540-46885-4_52openalex-snapshot
Feedforward Functions Defined by de Bruijn Sequences
inferred← citeshttps://doi.org/10.1007/3-540-46885-4_54openalex-snapshot
On the Linear Complexity of Feedback Registers
inferred← citeshttps://doi.org/10.1007/3-540-52921-7_57openalex-snapshot
Parallel algorithms for generating subsets and set partitions
inferred← citeshttps://doi.org/10.1007/3-540-57220-1_75openalex-snapshot
Construction of m-ary de Bruijn sequences (extended abstract)
inferred← citeshttps://doi.org/10.1007/978-1-4612-3352-7_15openalex-snapshot
On Pseudo-Random Arrays Constructed from Patterns with distinct Differences
inferred← citeshttps://doi.org/10.1007/978-3-030-23247-4_10openalex-snapshot
Generalized de Bruijn Words and the State Complexity of Conjugate Sets
inferred← citeshttps://doi.org/10.1007/978-3-030-39219-2_29openalex-snapshot
Greedy Universal Cycle Constructions for Weak Orders
inferred← citeshttps://doi.org/10.1007/978-3-030-79770-6_12openalex-snapshot
Areas of Application for Nonlinear Shift Registers in PRS Generators
inferred← citeshttps://doi.org/10.1007/978-3-031-34326-1_14openalex-snapshot
A Tight Upper Bound on the Length of Maximal Bordered Box Repetition-Free Words
inferred← citeshttps://doi.org/10.1007/978-3-031-55598-5_9openalex-snapshot
A BWT-Based Algorithm for Random de Bruijn Sequence Construction
inferred← citeshttps://doi.org/10.1007/978-3-032-05228-5_18openalex-snapshot
Smallest Suffixient Sets as a Repetitiveness Measure
inferred← citeshttps://doi.org/10.1007/978-3-319-10683-0_7openalex-snapshot
Generating Good Span n Sequences Using Orthogonal Functions in Nonlinear Feedback Shift Registers
inferred← citeshttps://doi.org/10.1007/978-3-319-11520-7_8openalex-snapshot
A Scalable Method for Constructing Non-linear Cellular Automata with Period 2 n − 1
inferred← citeshttps://doi.org/10.1007/978-3-319-19315-1_7openalex-snapshot
Computing Minimum Length Representations of Sets of Words of Uniform Length
inferred← citeshttps://doi.org/10.1007/978-3-319-26961-0_20openalex-snapshot
A New Distinguisher on Grain v1 for 106 Rounds
inferred← citeshttps://doi.org/10.1007/978-3-319-66396-8_21openalex-snapshot
Burrows-Wheeler Transform and Run-Length Enconding
inferred← citeshttps://doi.org/10.1007/978-3-319-74325-7_15openalex-snapshot
De Bruijn Sequences and Suffix Arrays: Analysis and Constructions
inferred← citeshttps://doi.org/10.1007/978-3-319-93031-2_2openalex-snapshot
Propagating lex, find and replace with Dashed Strings
inferred← citeshttps://doi.org/10.1007/978-3-319-95162-1_5openalex-snapshot
NLFSR Functions with Optimal Periods
inferred← citeshttps://doi.org/10.1007/978-3-540-30559-0_14openalex-snapshot
Minimal de Bruijn Sequence in a Language with Forbidden Substrings
inferred← citeshttps://doi.org/10.1007/978-3-642-15428-7_6openalex-snapshot
Preliminary Results on the Adoption of De Bruijn Binary Sequences in DS-CDMA Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-15874-2_3openalex-snapshot
An Algorithm for Constructing a Fastest Galois NLFSR Generating a Given Sequence
inferred← citeshttps://doi.org/10.1007/978-3-642-22418-8_47openalex-snapshot
A New Symmetry of De Bruijn Sequences
inferred← citeshttps://doi.org/10.1007/978-3-642-33027-8_8openalex-snapshot
A Differential Fault Attack on the Grain Family of Stream Ciphers
inferred← citeshttps://doi.org/10.1007/978-3-642-34416-9_7openalex-snapshot
Some Results on Related Key-IV Pairs of Grain
inferred← citeshttps://doi.org/10.1007/978-3-642-35999-6_8openalex-snapshot
Cryptographically Strong de Bruijn Sequences with Large Periods
inferred← citeshttps://doi.org/10.1007/978-3-642-39059-3_2openalex-snapshot
A Chosen IV Related Key Attack on Grain-128a
inferred← citeshttps://doi.org/10.1007/978-3-642-45278-9_4openalex-snapshot
Deciding Representability of Sets of Words of Equal Length in Polynomial Time
inferred← citeshttps://doi.org/10.1007/978-3-662-53644-5_11openalex-snapshot
Virtual Grey-Boxes Beyond Obfuscation: A Statistical Security Notion for Cryptographic Agents
inferred← citeshttps://doi.org/10.1007/978-3-7091-2640-0_12openalex-snapshot
Pseudo-Random Sequences with a Priori Distribution
inferred← citeshttps://doi.org/10.1007/978-981-13-0023-3_11openalex-snapshot
On Leaf Node Edge Switchings in Spanning Trees of De Bruijn Graphs
inferred← citeshttps://doi.org/10.1007/978-981-97-0407-1_9openalex-snapshot
MRMM-Based Keystream Generators for Information Security
inferred← citeshttps://doi.org/10.1007/bf01389353openalex-snapshot
The lower bound of the quadratic spans of Debruijn sequences
inferred← citeshttps://doi.org/10.1007/bf01390770openalex-snapshot
New constructions for De Bruijn tori
inferred← citeshttps://doi.org/10.1007/bf01397666openalex-snapshot
Perfect factors in the de Bruijn graph
inferred← citeshttps://doi.org/10.1007/bf02174130openalex-snapshot
Disordered ground states for classical discrete-state problems in one dimension
inferred← citeshttps://doi.org/10.1007/bf02684757openalex-snapshot
A fast algorithm for the generation ofk-ary De Bruijn sequences
inferred← citeshttps://doi.org/10.1007/bf02778357openalex-snapshot
A new algorithm for the generation ofk-AryM sequences
inferred← citeshttps://doi.org/10.1007/bf02988306openalex-snapshot
On the maximum number of distinct factors of a binary string
inferred← citeshttps://doi.org/10.1007/s00010-002-8032-6openalex-snapshot
Constructions for higher dimensional perfect multifactors
inferred← citeshttps://doi.org/10.1007/s00026-004-0201-yopenalex-snapshot
Generalized de Bruijn Cycles
inferred← citeshttps://doi.org/10.1007/s00138-019-01050-8openalex-snapshot
Absolute time encoding for temporal super-resolution using de Bruijn coded exposures
inferred← citeshttps://doi.org/10.1007/s00200-020-00459-3openalex-snapshot
On greedy algorithms for binary de Bruijn sequences
inferred← citeshttps://doi.org/10.1007/s00591-020-00293-1openalex-snapshot
De-Bruijn-Folgen und Zauberei
inferred← citeshttps://doi.org/10.1007/s10623-012-9723-1openalex-snapshot
On the largest affine sub-families of a family of NFSR sequences
inferred← citeshttps://doi.org/10.1007/s10623-014-9947-3openalex-snapshot
Generation of full cycles by a composition of NLFSRs
inferred← citeshttps://doi.org/10.1007/s10623-016-0187-6openalex-snapshot
The adjacency graphs of some feedback shift registers
inferred← citeshttps://doi.org/10.1007/s10623-016-0309-1openalex-snapshot
Construction for de Bruijn sequences with large stage
inferred← citeshttps://doi.org/10.1007/s10623-016-0314-4openalex-snapshot
Stretching de Bruijn sequences
inferred← citeshttps://doi.org/10.1007/s10623-018-0509-yopenalex-snapshot
On binary de Bruijn sequences from LFSRs with arbitrary characteristic polynomials
inferred← citeshttps://doi.org/10.1007/s10623-019-00677-yopenalex-snapshot
Further results on the equivalence between Galois NFSRs and Fibonacci NFSRs
inferred← citeshttps://doi.org/10.1007/s10623-020-00759-2openalex-snapshot
Longest subsequences shared by two de Bruijn sequences
inferred← citeshttps://doi.org/10.1007/s10623-021-00992-3openalex-snapshot
Regular complete permutation polynomials over $${\mathbb {F}}_{2^{n}}$$
inferred← citeshttps://doi.org/10.1007/s10623-022-01077-5openalex-snapshot
Designing preference functions for de Bruijn sequences with forbidden words
inferred← citeshttps://doi.org/10.1007/s10623-022-01100-9openalex-snapshot
Properties of the cycles that contain all vectors of weight $$\le k$$
inferred← citeshttps://doi.org/10.1007/s10623-022-01108-1openalex-snapshot
A relation between sequences generated by Golomb’s preference algorithm
inferred← citeshttps://doi.org/10.1007/s10623-023-01224-6openalex-snapshot
A general construction of regular complete permutation polynomials
inferred← citeshttps://doi.org/10.1007/s10623-025-01580-5openalex-snapshot
Efficient generation of odd order de Bruijn sequence with the same complement and reverse sequences
inferred← citeshttps://doi.org/10.1007/s10623-025-01581-4openalex-snapshot
Constructing k-ary orientable sequences with asymptotically optimal length
inferred← citeshttps://doi.org/10.1007/s10623-025-01616-wopenalex-snapshot
On the cycle structure of a class of Galois NFSRs: component sequences possessing identical periods
inferred← citeshttps://doi.org/10.1007/s10623-025-01729-2openalex-snapshot
The expectation and the variance of the weights of de Bruijn sequences
inferred← citeshttps://doi.org/10.1007/s10623-026-01823-zopenalex-snapshot
Possible values for the nonlinearity of de bruijn feedback functions
inferred← citeshttps://doi.org/10.1007/s10623-026-01925-8openalex-snapshot
Extending binary sequences to maximum length sequences
inferred← citeshttps://doi.org/10.1007/s10623-026-01934-7openalex-snapshot
Near-optimal covering sequences
inferred← citeshttps://doi.org/10.1007/s11047-026-10064-xopenalex-snapshot
On the dynamics of bounded-degree automata networks
inferred← citeshttps://doi.org/10.1007/s11086-005-0039-zopenalex-snapshot
Test Sequence Construction Using Minimum Information on the Tested System
inferred← citeshttps://doi.org/10.1007/s11424-019-8072-9openalex-snapshot
A New Upper Bound on the Order of Affine Sub-families of NFSRs
inferred← citeshttps://doi.org/10.1007/s12095-012-0067-5openalex-snapshot
On the nonlinearity of maximum-length NFSR feedbacks
inferred← citeshttps://doi.org/10.1007/s12095-017-0219-8openalex-snapshot
Construction of de Bruijn sequences from product of two irreducible polynomials
inferred← citeshttps://doi.org/10.1007/s12095-017-0248-3openalex-snapshot
On ideal t-tuple distribution of filtering de Bruijn sequence generators
inferred← citeshttps://doi.org/10.1007/s12095-017-0273-2openalex-snapshot
The cycle structure of LFSR with arbitrary characteristic polynomial over finite fields
inferred← citeshttps://doi.org/10.1007/s12095-022-00562-xopenalex-snapshot
A number theoretic view on binary shift registers
inferred← citeshttps://doi.org/10.1007/s12095-024-00742-xopenalex-snapshot
Orientable sequences over non-binary alphabets
inferred← citeshttps://doi.org/10.1007/s12095-024-00747-6openalex-snapshot
Distribution of linear and second-highest degree parts of maximum-length feedback functions
inferred← citeshttps://doi.org/10.1007/s12095-025-00823-5openalex-snapshot
New successor rules to efficiently produce exponentially many binary de Bruijn sequences
inferred← citeshttps://doi.org/10.1007/s42979-021-00683-9openalex-snapshot
Binary de Bruijn Sequences via Zech’s Logarithms
inferred← citeshttps://doi.org/10.1016/0012-365x(86)90089-0openalex-snapshot
An algorithm for generating necklaces of beads in two colors
inferred← citeshttps://doi.org/10.1016/0012-365x(91)90024-vopenalex-snapshot
On the numbers of spanning trees and Eulerian tours in generalized de Bruijn graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(91)90362-6openalex-snapshot
Covering the de Bruijn graph
inferred← citeshttps://doi.org/10.1016/0012-365x(92)00568-copenalex-snapshot
n-Dimensional line graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(92)90699-gopenalex-snapshot
Universal cycles for combinatorial structures
inferred← citeshttps://doi.org/10.1016/0012-365x(94)00215-5openalex-snapshot
Storage efficient decoding for a class of binary be Bruijn sequences
inferred← citeshttps://doi.org/10.1016/0012-365x(94)00265-kopenalex-snapshot
On the classification of deBruijn sequences
inferred← citeshttps://doi.org/10.1016/0012-365x(94)90291-7openalex-snapshot
Weight class distributions of de Bruijn sequences
inferred← citeshttps://doi.org/10.1016/0012-365x(94)90294-1openalex-snapshot
Universal circuit matrix for adjacency graphs of feedback functions
inferred← citeshttps://doi.org/10.1016/0012-365x(96)00106-9openalex-snapshot
De Bruijn sequences, irreducible codes and cyclotomy
inferred← citeshttps://doi.org/10.1016/0020-0190(88)90219-0openalex-snapshot
On the connectivity of the De Bruijn graph
inferred← citeshttps://doi.org/10.1016/0020-0190(90)90136-lopenalex-snapshot
Tight lower bounds on the length of word chains
inferred← citeshttps://doi.org/10.1016/0097-3165(85)90074-3openalex-snapshot
On the distribution of de bruijn sequences of low complexity
inferred← citeshttps://doi.org/10.1016/0097-3165(93)90087-oopenalex-snapshot
On the de Bruijn Torus problem
inferred← citeshttps://doi.org/10.1016/0166-218x(87)90072-2openalex-snapshot
Notes on de Bruijn sequences
inferred← citeshttps://doi.org/10.1016/0166-218x(92)90133-uopenalex-snapshot
A new look at the de Bruijn graph
inferred← citeshttps://doi.org/10.1016/0166-218x(92)90149-5openalex-snapshot
Asymptotically-tight bounds on the number of cycles in generalized de Bruijn-Good graphs
inferred← citeshttps://doi.org/10.1016/0196-6774(86)90025-8openalex-snapshot
An algorithm for constructing m-ary de Bruijn sequences
inferred← citeshttps://doi.org/10.1016/0196-6774(90)90028-dopenalex-snapshot
A new algorithm for the generation of binary de Bruijn sequences
inferred← citeshttps://doi.org/10.1016/0196-8858(92)90021-nopenalex-snapshot
Characterizations of generators for modified de Bruijn sequences
inferred← citeshttps://doi.org/10.1016/0378-3758(94)00119-gopenalex-snapshot
A review of reliable maximum likelihood algorithms for semiparametric mixture models
inferred← citeshttps://doi.org/10.1016/b978-0-12-374890-4.00006-9openalex-snapshot
Fourier analysis of Boolean functions
inferred← citeshttps://doi.org/10.1016/b978-0-12-811129-1.00002-xopenalex-snapshot
Fourier Analysis of Boolean Functions
inferred← citeshttps://doi.org/10.1016/b978-0-44-313517-0.00010-xopenalex-snapshot
Constructions of full cycles
inferred← citeshttps://doi.org/10.1016/j.aam.2003.10.002openalex-snapshot
On the theorem of Fredricksen and Maiorana about de Bruijn sequences
inferred← citeshttps://doi.org/10.1016/j.aam.2012.12.002openalex-snapshot
Generalized Fibonacci recurrences and the lex-least de Bruijn sequence
inferred← citeshttps://doi.org/10.1016/j.chaos.2018.01.012openalex-snapshot
A novel method for reconstructing period with single input in NFSR
inferred← citeshttps://doi.org/10.1016/j.csi.2008.12.001openalex-snapshot
An efficient implementation algorithm for generating de Bruijn sequences
inferred← citeshttps://doi.org/10.1016/j.dam.2011.11.024openalex-snapshot
Spans of preference functions for de Bruijn sequences
inferred← citeshttps://doi.org/10.1016/j.dam.2018.06.032openalex-snapshot
An interleaved method for constructing de Bruijn sequences
inferred← citeshttps://doi.org/10.1016/j.disc.2007.11.003openalex-snapshot
The directed genus of the de Bruijn graph
inferred← citeshttps://doi.org/10.1016/j.disc.2007.11.027openalex-snapshot
Minimum Eulerian circuits and minimum de Bruijn sequences
inferred← citeshttps://doi.org/10.1016/j.disc.2009.03.002openalex-snapshot
Universal cycles of (n−1) -partitions of an n -set
inferred← citeshttps://doi.org/10.1016/j.disc.2009.11.010openalex-snapshot
The discrepancy of the lex-least de Bruijn sequence
inferred← citeshttps://doi.org/10.1016/j.disc.2015.05.025openalex-snapshot
Generalized de Bruijn words for primitive words and powers
inferred← citeshttps://doi.org/10.1016/j.disc.2016.09.008openalex-snapshot
A simple shift rule for k -ary de Bruijn sequences
inferred← citeshttps://doi.org/10.1016/j.disc.2018.07.010openalex-snapshot
A framework for constructing de Bruijn sequences via simple successor rules
inferred← citeshttps://doi.org/10.1016/j.disc.2021.112368openalex-snapshot
An efficiently generated family of binary de Bruijn sequences
inferred← citeshttps://doi.org/10.1016/j.disc.2021.112780openalex-snapshot
Investigating the discrepancy property of de Bruijn sequences
inferred← citeshttps://doi.org/10.1016/j.disc.2025.114740openalex-snapshot
The cycle structure of a class of permutation binomials
inferred← citeshttps://doi.org/10.1016/j.disc.2026.115081openalex-snapshot
On shortening universal words for multi-dimensional permutations
inferred← citeshttps://doi.org/10.1016/j.ffa.2017.12.007openalex-snapshot
Preliminary results on the minimal polynomial of modified de Bruijn sequences
inferred← citeshttps://doi.org/10.1016/j.ffa.2018.05.004openalex-snapshot
The adjacency graphs of FSRs with a class of affine characteristic functions
inferred← citeshttps://doi.org/10.1016/j.ffa.2019.101574openalex-snapshot
Constructions of de Bruijn sequences from a full-length shift register and an irreducible LFSR
inferred← citeshttps://doi.org/10.1016/j.ffa.2026.102790openalex-snapshot
De Bruijn tori without zeros: a field-theoretic perspective
inferred← citeshttps://doi.org/10.1016/j.ic.2021.104689openalex-snapshot
Maximal state complexity and generalized de Bruijn words
inferred← citeshttps://doi.org/10.1016/j.imavis.2015.04.004openalex-snapshot
Optimized projection patterns for stereo systems
inferred← citeshttps://doi.org/10.1016/j.ipl.2005.05.028openalex-snapshot
De Bruijn sequences and De Bruijn graphs for a general language
inferred← citeshttps://doi.org/10.1016/j.ipl.2011.06.013openalex-snapshot
On extending de Bruijn sequences
inferred← citeshttps://doi.org/10.1016/j.jcss.2014.12.030openalex-snapshot
A new linearization method for nonlinear feedback shift registers
inferred← citeshttps://doi.org/10.1016/j.jctb.2019.08.003openalex-snapshot
Approximate Moore Graphs are good expanders
inferred← citeshttps://doi.org/10.1016/j.optcom.2012.10.042openalex-snapshot
One-shot absolute pattern for dense reconstruction using DeBruijn coding and Windowed Fourier Transform
inferred← citeshttps://doi.org/10.1016/j.patcog.2003.10.002openalex-snapshot
Pattern codification strategies in structured light systems
inferred← citeshttps://doi.org/10.1016/j.patcog.2010.03.004openalex-snapshot
A state of the art in structured light patterns for surface profilometry
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.06.038openalex-snapshot
Computing minimum length representations of sets of words of uniform length
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.07.015openalex-snapshot
Measuring the clustering effect of BWT via RLE
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.09.010openalex-snapshot
Computing generalized de Bruijn sequences
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.06.039openalex-snapshot
Constructing de Bruijn sequences by concatenating smaller universal cycles
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.11.018openalex-snapshot
Revisiting the Prefer-same and Prefer-opposite de Bruijn sequence constructions
inferred← citeshttps://doi.org/10.1016/s0012-365x(01)00425-3openalex-snapshot
Extreme weight classes of de Bruijn sequences
inferred← citeshttps://doi.org/10.1016/s0019-9958(86)80048-1openalex-snapshot
A simplified lower bound for context-free-language recognition
inferred← citeshttps://doi.org/10.1016/s0031-3203(99)00224-1openalex-snapshot
Decoding structured light patterns for three-dimensional imaging systems
inferred← citeshttps://doi.org/10.1016/s0378-3758(97)84208-5openalex-snapshot
The combinatorics of binary arrays
inferred← citeshttps://doi.org/10.1016/s0898-1221(00)00109-7openalex-snapshot
Clues to the hidden nature of de Bruijn sequences
inferred← citeshttps://doi.org/10.1038/s41598-024-82649-4openalex-snapshot
A reinforcement learning approach to effective forecasting of pediatric hypoglycemia in diabetes I patients using an extended de Bruijn graph
inferred← citeshttps://doi.org/10.1049/cje.2016.03.017openalex-snapshot
On Characteristic Functions of De Bruijn Sequences
inferred← citeshttps://doi.org/10.1049/cje.2019.08.004openalex-snapshot
The Adjacency Graphs of a Class of LFSRs and Their Applications*
inferred← citeshttps://doi.org/10.1049/el:19860717openalex-snapshot
Complexity and autocorrelation properties of a class of de Bruijn sequences
inferred← citeshttps://doi.org/10.1051/ita:2002005openalex-snapshot
On the distribution of characteristic parameters of words II
inferred← citeshttps://doi.org/10.1051/ita:2002006openalex-snapshot
On the distribution of characteristic parameters of words
inferred← citeshttps://doi.org/10.1063/5.0108300openalex-snapshot
Combined greedy algorithm on construction binary de Bruijn sequence
inferred← citeshttps://doi.org/10.1073/pnas.1215998109openalex-snapshot
A zoo of computable binary normal sequences
inferred← citeshttps://doi.org/10.1073/pnas.1402621111openalex-snapshot
Higher-order dangers and precisely constructed taxa in models of randomness
inferred← citeshttps://doi.org/10.1080/0025570x.1982.11976970openalex-snapshot
De Bruijn Sequences-A Model Example of the Interaction of Discrete Mathematics and Computer Science
inferred← citeshttps://doi.org/10.1080/00949650802322129openalex-snapshot
A multiple stream generator based on de Bruijn digraph homomorphisms
inferred← citeshttps://doi.org/10.1088/0305-4470/35/3/316openalex-snapshot
Antipersistent binary time series
inferred← citeshttps://doi.org/10.1088/1742-6596/1320/1/012020openalex-snapshot
Permutation on binary de bruijn sequence
inferred← citeshttps://doi.org/10.1088/1742-6596/2090/1/012047openalex-snapshot
Review on de Bruijn shapes in one, two and three dimensions
inferred← citeshttps://doi.org/10.1089/cmb.1998.5.615openalex-snapshot
A Sticker-Based Model for DNA Computation
inferred← citeshttps://doi.org/10.1090/conm/632/12637openalex-snapshot
On cross joining de Bruijn sequences
inferred← citeshttps://doi.org/10.1090/dimacs/044/01openalex-snapshot
A sticker based model for DNA computation
inferred← citeshttps://doi.org/10.1093/ietfec/e90-a.10.2079openalex-snapshot
Maximal-Period Sequences Generated by Feedback-Limited Nonlinear Shift Registers
inferred← citeshttps://doi.org/10.1103/physrevlett.97.208103openalex-snapshot
Molecular Shift Register and its Utilization as an Autonomous DNA Synthesizer
inferred← citeshttps://doi.org/10.1109/12.260637openalex-snapshot
Fault-tolerant ring embedding in de Bruijn networks
inferred← citeshttps://doi.org/10.1109/12.565593openalex-snapshot
Distributed ring embedding in faulty De Bruijn networks
inferred← citeshttps://doi.org/10.1109/12.565596openalex-snapshot
Generating De Bruijn sequences: an efficient implementation
inferred← citeshttps://doi.org/10.1109/12.588065openalex-snapshot
Average and worst case number of nodes in decision diagrams of symmetric multiple-valued functions
inferred← citeshttps://doi.org/10.1109/12.93750openalex-snapshot
Fault-tolerant networks based on the de Bruijn graph
inferred← citeshttps://doi.org/10.1109/18.104342openalex-snapshot
The number of cross-join pairs in maximum length linear sequences
inferred← citeshttps://doi.org/10.1109/18.133272openalex-snapshot
An efficient algorithm for the generation of DeBruijn cycles
showing the first 200 of 397 · page through all 397
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.