Abstract:
This paper describes a newly discovered aspect of T-codes, a family of
variable length codes first described by Titchener in the 1980s. We show
that the constant-length subsets of codewords generated during the T-
code construction process constitute sets of necklaces. Moreover, we show
that these sets are complete except for a small subset which we character-
ize. Bounds on the number of constant-length subsets of codewords are
determined based on necklaces.