ITITJun 29

Binary and Non-Binary Self-Dual Sequences and Maximum Period Single-Track Gray Codes

arXiv:2512.0965512.62 citationsh-index: 38
Predicted impact top 2% in IT · last 90 daysOriginality Incremental advance
AI Analysis

Provides the first infinite families of maximum period single-track Gray codes, a theoretical advance for coding theory.

The paper constructs the first infinite families of maximum period non-binary single-track Gray codes of length p^t and period p^{p^t}, building on binary and non-binary self-dual sequences.

Binary self-dual sequences have been considered and analyzed throughout the years, and they have been used for various applications. Motivated by a construction for single-track Gray codes, we examine the structure and recursive constructions for binary and non-binary self-dual sequences. The feedback shift registers that generate such sequences are discussed. The connections between these sequences and maximum period single-track codes are also discussed. Maximum period non-binary single-track Gray codes of length $p^t$ and period $p^{p^t}$ are constructed. These are the first infinite families of maximum period codes presented in the literature.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes