Further Results on Circuit Codes

09/22/2018

∙

by   Kevin M. Byrnes, et al.

∙

0

∙

share

We present a new characterization of circuit codes of spread k based on a theorem of Deimer. We also 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 exact value for the maximum length of symmetric codes substantially improves upon the general case upper bound of Douglas for circuit codes with long bit runs.