|Title:||The Structure of Single-Track Gray Codes
|Authors:||Moshe Schwartz, Tuvi Etzion
|Abstract:||Single-track Gray codes are cyclic Gray codes with codewords of length $n$, such that all the $n$ tracks which correspond to the $n$ distinct coordinates of the codewords are cyclic shifts of the first track. We investigate the structure of such binary codes and show that there is no such code with $2^n$ codewords when $n$ is a power of 2. This implies that the known codes with $2^n -2n$ codewords, when $n$ is a power of 2, are optimal. This result is then generalized to codes over $GF(p)$, where $p$ is a prime. A subclass of single-track Gray codes, called single-track Gray codes with evenly spaced heads, is also defined. All known systematic constructions for single-track Gray codes result in codes from this subclass. We investigate this class and show it has a strong connection with two classes of sequences, the full-period necklaces and the full-period self-dual necklaces. We present an iterative construction for binary single-track Gray codes which are asymptotically optimal if an infinite family of asymptotically optimal seed-codes exists. This construction is based on an effective way to generate a large set of nonequivalent necklaces and a merging method for cyclic Gray codes based on necklaces representatives.|
|Copyright||The above paper is copyright by the Technion, Author(s), or others. Please contact the author(s) for more information|
Remark: Any link to this technical report should be to this page (http://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-info.cgi/1998/CS/CS0937), rather than to the URL of the PDF files directly. The latter URLs may change without notice.
To the list of the CS technical reports of 1998
To the main CS technical reports page
Computer science department, Technion