On the public citation graph
Perfect factors in the de Bruijn graph
0 signed · 43 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.1007/3-540-39118-5_2openalex-snapshot
Alternating Step Generators Controlled by De Bruijn Sequences
inferredcites →https://doi.org/10.1007/bfb0046097openalex-snapshot
Efficient Structures for Geometric Data Management
inferredcites →https://doi.org/10.1007/bfb0046099openalex-snapshot
Operators and representation schemes for geometric data
inferredcites →https://doi.org/10.1016/0012-365x(76)90143-6openalex-snapshot
The homeomorphic embedding of Kn in the m-cube
inferredcites →https://doi.org/10.1016/0012-365x(88)90095-7openalex-snapshot
Toroidal tilings from de Bruijn-Good cyclic sequences
inferredcites →https://doi.org/10.1016/0012-365x(92)90546-ropenalex-snapshot
Some VLSI decompositions of the de Bruijn graph
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/0097-3165(93)90087-oopenalex-snapshot
On the de Bruijn Torus problem
inferredcites →https://doi.org/10.1016/0166-218x(87)90072-2openalex-snapshot
Notes on de Bruijn sequences
inferredcites →https://doi.org/10.1016/0196-6774(86)90025-8openalex-snapshot
An algorithm for constructing m-ary de Bruijn sequences
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1109/12.93750openalex-snapshot
Fault-tolerant networks based on the de Bruijn graph
inferredcites →https://doi.org/10.1109/18.21260openalex-snapshot
Constructions for perfect maps and pseudorandom arrays
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/tit.1969.1054260openalex-snapshot
Shift-register synthesis and BCH decoding
inferredcites →https://doi.org/10.1109/tit.1983.1056619openalex-snapshot
A fast algorithm for determining the complexity of a binary sequence with period2^n(Corresp.)
inferredcites →https://doi.org/10.1109/tit.1984.1056947openalex-snapshot
A note on binary arrays with a certain window property (Corresp.)
inferredcites →https://doi.org/10.1109/tit.1984.1056965openalex-snapshot
Construction of de Bruijn sequences of minimal complexity
inferredcites →https://doi.org/10.1137/1024041openalex-snapshot
A Survey of Full Length Nonlinear Shift Register Cycle Algorithms
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jcta.1996.0025openalex-snapshot
New Classes of Perfect Maps II
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.1998.2920openalex-snapshot
On the Minimum Linear Complexity of de Bruijn Sequences over Non-prime Finite Fields
inferred← citeshttps://doi.org/10.1007/978-1-4615-2694-0_4openalex-snapshot
Aspects of Linear Complexity
inferred← citeshttps://doi.org/10.1007/978-3-642-38519-3_20openalex-snapshot
New Sequences of Period p n and p n + 1 via Projective Linear Groups
inferred← citeshttps://doi.org/10.1007/bf01390770openalex-snapshot
New constructions for De Bruijn tori
inferred← citeshttps://doi.org/10.1007/s00010-002-8032-6openalex-snapshot
Constructions for higher dimensional perfect multifactors
inferred← citeshttps://doi.org/10.1007/s00200-003-0134-4openalex-snapshot
Periodic Sequences with Maximal Linear Complexity and Large k -Error Linear Complexity
inferred← citeshttps://doi.org/10.1007/s40306-014-0108-6openalex-snapshot
Linear Difference Equations and Periodic Sequences over Finite Fields
inferred← citeshttps://doi.org/10.1016/b978-0-44-313517-0.00015-9openalex-snapshot
Two-dimensional arrays
inferred← citeshttps://doi.org/10.1109/18.532887openalex-snapshot
A method for constructing decodable de Bruijn sequences
inferred← citeshttps://doi.org/10.1109/tit.2024.3518434openalex-snapshot
On de Bruijn Array Codes—Part I: Nonlinear Codes
inferred← citeshttps://doi.org/10.1137/s0895480195290911openalex-snapshot
De Bruijn Sequences and Perfect Factors
inferred← citeshttps://doi.org/10.1137/s089548019630649xopenalex-snapshot
Perfect Factors from Cyclic Codes and Interleaving
inferred← citeshttps://doi.org/10.48550/arxiv.1003.5028openalex-snapshot
Linear difference equations and periodic sequences over finite fields
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.