Binary and Non-Binary Self-Dual Sequences and Maximum Period Single-Track Gray Codes
By: Tuvi Etzion
Binary self-dual sequences have been considered and analyzed throughout the years, and they were 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 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.
Similar Papers
Hermitian Self-dual Twisted Generalized Reed-Solomon Codes
Information Theory
Makes secret messages harder to break.
Binary cyclic codes from permutation polynomials over $\mathbb{F}_{2^m}$
Information Theory
Makes computer signals stronger and safer from errors.
On Binary Codes That Are Maximal Totally Isotropic Subspaces with Respect to an Alternating Form
Information Theory
Finds new math codes for better computers.