Orientation-resolving XOR product arrays from sequence pairs
We study binary two-dimensional position patterns formed as XOR products A[i,j] = t_i XOR s_j of two one-dimensional sequences. We characterize exactly when such a product resolves both position and quarter-turn orientation, count the available factor and pair orbits, derive linear and cyclic area bounds, and prove a deterministic majority-decoding guarantee for square reads with bounded pixel errors. Checked sequence-splitting constructions for window orders 12, 14, 16, 18, and 20 use 80.44%–91.83% of available one-dimensional orbits and attain 63.65%–84.32% of the admissible linear cell-area bound. The paper distinguishes proved statements, finite computational results, observations, and open problems.
Authors
- Franciscus Gerardus Adrianus Van den Berg (ORCID: https://orcid.org/0009-0006-4324-0743)
Publication Details
- Journal
- Zenodo (CERN European Organization for Nuclear Research)
- Published
- 2026-11-14
- DOI
- https://doi.org/10.5281/zenodo.24230265
- Primary Topic
- Coding theory and cryptography
- Type
- preprint