Near optimal single-track Gray codes

Abstract

Single-track Gray codes are a special class of Gray codes which have advantages over conventional Gray codes in certain quantization and coding applications. The problem of constructing high period single-track Gray codes is considered. Three iterative constructions are given, along with a heuristic method for obtaining good seed-codes. In combination, these yield many families of very high period single-track Gray codes. In particular, for m/spl ges/3, length n=2/sup m/, period 2/sup n/-2n codes are obtained.