The Maximum Length of Circuit Codes With Long Bit Runs and a New Characterization Theorem
arXiv:1809.08428
Abstract
We study circuit codes with long bit runs (sequences of distinct transitions) and derive a formula for the maximum length for an infinite class of symmetric circuit codes with long bit runs. This formula also results in an improved lower bound on the maximum length for an infinite class of circuit codes without restrictions on symmetry or bit run length. We also present a new characterization of circuit codes of spread based on a theorem of Deimer.
12 pages; corrected typos and made notation more consistent, minor corrections to Lemma 3.8, added Corollary 4.3