Single-track circuit codes

Single-track circuit codes (STTCs) are circuit 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. These codes simultaneously generalize single-track Gray codes and ordinary circuit codes. They are useful in angular quantization applications in which error detecting and/or correcting capabilities are needed. A parameter k, called the spread of the code, measures the strength of this error control capability. We consider the existence of STCCs for small lengths n/spl les/17 and spreads k/spl les/6, constructing some optimal and many good examples. We then give a general construction method for STCCs which makes use of ordinary circuit codes. We use this construction to construct examples of codes with 360 and 1000 codewords which are of practical importance. We also use the construction to prove a general result on the existence of STCCs for general spreads.

[1]  Hunter S. Snevily The snake-in-the-box problem: A new upper bound , 1994, Discrete Mathematics.

[2]  Kenneth G. Paterson,et al.  Single-track Gray codes , 1996, IEEE Trans. Inf. Theory.

[3]  Victor Klee,et al.  A Method for Constructing Circuit Codes , 1967, JACM.

[4]  Pavel G. Emelyanov,et al.  On the maximal length of a snake in hypercubes of small dimension , 2000, Discret. Math..

[5]  Robert J. Douglas,et al.  Upper bounds on the length of circuits of even spread in the d-cube , 1969 .

[6]  Knut Deimer A new upper bound for the length of snakes , 1985, Comb..

[7]  Richard C. Singleton,et al.  Generalized Snake-in-the-Box Codes , 1966, IEEE Trans. Electron. Comput..

[8]  Moshe Schwartz,et al.  The structure of single-track Gray codes , 1999, IEEE Trans. Inf. Theory.

[9]  Gilles Zémor An upper bound on the size of the snake-in-the-box , 1997, Comb..

[10]  Kenneth G. Paterson,et al.  Some New Circuit Codes , 1998, IEEE Trans. Inf. Theory.

[11]  Victor Klee THE USE OF CIRCUIT CODES IN ANALOG-TO-DIGITAL CONVERSION, , 1970 .

[12]  K. Deimer,et al.  Some new bounds for the maximum length of circuit codes , 1984, IEEE Trans. Inf. Theory.

[13]  Robert J. Douglas,et al.  Some results on the maximum length of circuits of spread k in the d-cube* , 1969 .

[14]  E. Gilbert Gray codes and paths on the N-cube , 1958 .

[15]  Micha Sharir,et al.  Quasi-planar graphs have a linear number of edges , 1995, GD.

[16]  Donald W. Davies,et al.  Longest "Separated" Paths and Loops in an N Cube , 1965, IEEE Trans. Electron. Comput..

[17]  Kenneth G. Paterson,et al.  Near optimal single-track Gray codes , 1996, IEEE Trans. Inf. Theory.