NEAR-OPTIMAL SINGLE-TRACK GRAY CODES

Single-track Gray codes are a special class of Gray codes which have a dvantages over conventional Gray codes in certain quantization and cod ing applications, The problem of constructing high period single-track Gray codes is considered, Three iterative constructions are given, al ong with a heuristic method for obtaining good seed-codes, In combinat ion, these yield many families of very high period single-track Gray c odes, In particular, for m greater than or equal to 3, length n = 2(m) , period 2(n) - 2n codes are obtained.