Some new circuit codes

IEEE Transactions on Information Theory

Volumn 44, Issue 3, 1998, Pages 1305-1309

  Paterson, Kenneth G ^a,b,c   Tuliani, Jonathan ^b  

^a IEEE   (United Kingdom)

^b UNIVERSITY OF LONDON   (United Kingdom)

^c HEWLETT PACKARD LABORATORIES   (United Kingdom)

Author keywords

Circuit code; Necklaces; Snake in the box code

Indexed keywords

COMPUTER APPLICATIONS; EQUIVALENCE CLASSES; ERROR CORRECTION; ERROR DETECTION; ONLINE SEARCHING;

CIRCUIT CODES; CYCLIC SHIFTING; GRAY CODES;

CODES (SYMBOLS);

EID: 0032074623     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.669420     Document Type: Article

References (15)

1. H. L. Abbott and M. Katchalski, "On the construction of snake in the box codes," Utilitas Mathematica, vol. 40, pp. 97-116, 1991.
2. R. T. Chien, C. V. Freiman, and D. T. Tang, "Error correction and circuits on the n-cube," Proc. 2nd Allerton Conf. Circuit and System Theory (Univ. of Illinois, Monitcello, Ill., Sept. 28-30, 1964), pp. 899-912.
3. D. W. Davies, "Longest 'separated' paths and loops in an N cube," IEEE Trans. Electron. Comp., vol. EC-14, p. 261, 1965.
4. K. Deimer, "Some new bounds for the maximum length of circuit codes," IEEE Trans. Inform. Theory, vol. IT-30, pp. 754-756, 1984.
5. R. J. Douglas, "Some results on the maximum length of circuits of spread k in the d-cube," J. Comb. Theory, vol. 6, pp. 323-339, 1969.
6. _, "Upper bounds on the length of circuits of even spread in the d-cube," J. Comb. Theory, vol. 7, pp. 206-214, 1969.
7. T. Etzion and K. G. Paterson, "Near optimal single-track Gray codes," IEEE Trans. Inform. Theory, vol. 42, pp. 779-789, 1996.
8. A. P. Hiltgen, K. G. Paterson, and M. Brandestini, "Single-track Gray codes," IEEE Trans. Inform. Theory, vol. 42, pp. 1555-1561, Sept. 1006.
9. W. H. Kautz, "Unit-distance error-checking codes," IRE Trans. Electron. Comp., vol. EC-7, pp. 179-180, 1958.
10. V. Klee, "The use of circuit codes in analog-to-digital conversion," in Graph Theory and its Applications, B. Harris, Ed. New York: Academic, 1970.
11. _, "A method for constructing circuit codes," J. Assoc. Comput. Mach., vol. 14, pp. 520-528, 1967.
12. K. J. Kochut, "Snake-in-the-box codes for dimension 7," J. Comb. Math. and Comb. Comp., vol. 20, pp. 175-185, 1996.
13. R. C. Singleton, "Generalized snake-in-the-box codes," IEEE Trans. Electron. Comp., vol. EC-15, pp. 596-602, 1966.
14. H. S. Snevily, "The snake-in-the-box problem: A new upper bound," Discr. Math., vol. 133, pp. 307-314, 1994.
15. G. Zémor, "An upper bound on the size of the snake-in-the-box," Combinatorica, vol. 17, pp. 1-12, 1997.