On the public citation graph
Decoding Perfect Maps
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/978-1-349-03521-2openalex-snapshot
Graph Theory with Applications
inferredcites →https://doi.org/10.1016/0012-365x(94)00215-5openalex-snapshot
Storage efficient decoding for a class of binary be Bruijn sequences
inferredcites →https://doi.org/10.1049/el:19840042openalex-snapshot
Position recovery using binary sequences
inferredcites →https://doi.org/10.1049/el:19850151openalex-snapshot
Absolute-type pseudorandom shaft encoder with any desired resolution
inferredcites →https://doi.org/10.1049/el:19880841openalex-snapshot
Scanning method for absolute pseudorandom position encoders
inferredcites →https://doi.org/10.1049/el:19880929openalex-snapshot
New pseudorandom/natural code conversion method
inferredcites →https://doi.org/10.1109/18.21260openalex-snapshot
Constructions for perfect maps and pseudorandom arrays
inferredcites →https://doi.org/10.1109/18.53749openalex-snapshot
A new construction of two-dimensional arrays with the window property
inferredcites →https://doi.org/10.1109/19.32196openalex-snapshot
On the position measurement of automated guided vehicles using pseudorandom encoding
inferredcites →https://doi.org/10.1109/19.50460openalex-snapshot
Automated guided vehicle position recovery
inferredcites →https://doi.org/10.1109/proc.1976.10411openalex-snapshot
Pseudo-random sequences and arrays
inferredcites →https://doi.org/10.1109/tim.1987.6312588openalex-snapshot
Absolute-type position transducers using a pseudorandom encoding
inferredcites →https://doi.org/10.1109/tit.1962.1057681openalex-snapshot
Note on the existence of perfect maps
inferredcites →https://doi.org/10.1109/tit.1972.1054914openalex-snapshot
A theory of two-dimensional linear recurring arrays
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.1112/jlms/s1-21.3.169openalex-snapshot
Note on a Paper By I. J. Good
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.1007/978-1-4615-2694-0_4openalex-snapshot
Aspects of Linear Complexity
inferred← citeshttps://doi.org/10.1007/978-3-031-85187-2_21openalex-snapshot
PuzzleBoard: A New Camera Calibration Pattern with Position Encoding
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/s00010-002-8032-6openalex-snapshot
Constructions for higher dimensional perfect multifactors
inferred← citeshttps://doi.org/10.1016/b978-0-44-313517-0.00015-9openalex-snapshot
Two-dimensional arrays
inferred← citeshttps://doi.org/10.1016/b978-0-44-313517-0.00016-0openalex-snapshot
Two-dimensional applications
inferred← citeshttps://doi.org/10.1016/j.jcta.2025.106030openalex-snapshot
On de Bruijn rings and families of almost perfect maps
inferred← citeshttps://doi.org/10.1109/18.370116openalex-snapshot
Aperiodic and semi-periodic perfect maps
inferred← citeshttps://doi.org/10.1109/18.532887openalex-snapshot
A method for constructing decodable de Bruijn sequences
inferred← citeshttps://doi.org/10.1109/access.2021.3071877openalex-snapshot
M-Array Based on Non-Zero Maps
inferred← citeshttps://doi.org/10.1109/me54704.2022.9983063openalex-snapshot
Perfect Bit Fields and Their Technical Application
inferred← citeshttps://doi.org/10.1109/tit.2012.2191699openalex-snapshot
Simple and Robust Binary Self-Location Patterns
inferred← citeshttps://doi.org/10.1109/tit.2024.3518434openalex-snapshot
On de Bruijn Array Codes—Part I: Nonlinear Codes
inferred← citeshttps://doi.org/10.1134/s1990478919020091openalex-snapshot
On a Construction of Easily Decodable Sub-de Bruijn Arrays
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.30919/es1061openalex-snapshot
A comprehensive review of the de Bruijn graph and its interdisciplinary applications in computing
inferred← citeshttps://doi.org/10.48550/arxiv.1112.4253openalex-snapshot
Simple and Robust Binary Self-Location Patterns
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.