论文信息 - Near optimal single-track Gray codes

Near optimal single-track Gray codes

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.

Kenneth G. Paterson | Tuvi Etzion | K. Paterson | T. Etzion

[1] Tuvi Etzion. Self-dual sequences , 1987, J. Comb. Theory, Ser. A.

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

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

[4] Edward M. Reingold,et al. Efficient generation of the binary reflected gray code and its applications , 1976, CACM.

[6] T. C. Hu,et al. Combinatorial algorithms , 1982 .

[7] Abraham Lempel,et al. On a Homomorphism of the de Bruijn Graph and its Applications to the Design of Feedback Shift Registers , 1970, IEEE Transactions on Computers.

[8] A. Nijenhuis. Combinatorial algorithms , 1975 .

[9] W. H. Mills. Some complete cycles on the $n$-cube , 1963 .

[10] Tuvi Etzion,et al. Construction of de Bruijn sequences of minimal complexity , 1984, IEEE Trans. Inf. Theory.

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

[12] E. Reingold,et al. Combinatorial Algorithms: Theory and Practice , 1977 .

[13] A. J. van Zanten. Minimal-change order and separability in linear codes , 1993, IEEE Trans. Inf. Theory.