Construction of Certain Cyclic Distance-Preserving Codes Having Linear-Algebraic Characteristics

Designs, Codes, and Cryptography

Volumn 16, Issue 2, 1999, Pages 185-199

  Van Zanten, A J ^a   Lukito, Agung ^a  

^a DELFT UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

Circuit codes; Cyclic difference preserving codes; Cyclic distance preserving codes; Gray code

Indexed keywords

EID: 0346499900     PISSN: 09251022     EISSN: None     Source Type: Journal    
DOI: 10.1023/a:1008393130864     Document Type: Article

References (17)

1. H. L. Abott and M. Katchalski, On the construction of snake-in-the-box codes, Utilitas Math., Vol. 40 (1991) pp. 97-116.
2. R. J. Douglas, Some results on the maximum length of circuits of spread k in the d-cube, J. Comb. Theory, Vol. 6 (1969) pp. 323-339.
3. R. J. Douglas, Upper bounds on the length of circuits of even spread in the d-cube, J. Comb. Theory, Vol. 7 (1969) pp. 206-214.
4. P. G. Emel'yanov, An upper bound for the length of a snake-in-the n-dimensional unit cube, in Discrete Analysis and Operations Research (A. D. Korshunov, ed.), Kluwer Academic Publishers, Dordrecht/Boston/London (1997). (Translation from Sib. Zh. Issled. Oper., Vol. 2 (1995) pp. 10-17).
5. P. G. Emel'yanov, An upper bound for the length of a snake-in-the n-dimensional unit cube, in Discrete Analysis and Operations Research (A. D. Korshunov, ed.), Kluwer Academic Publishers, Dordrecht/Boston/London (1997). (Translation from Sib. Zh. Issled. Oper., Vol. 2 (1995) pp. 10-17).
6. A. A. Evdokimov, Maximal length of a circuit in a unitary n-dimensional cube, Math. Notes, Vol. 6 (1969) pp. 642-648.
7. A. A. Evdokimov, Circuit codes with arbitrary distance, Soviet Math. Dokl., Vol. 17 (1976) pp. 900-904.
8. A. A. Evdokimov, O numeratsii podmnozhestv konechnogo mnozhẽstṽa (1980), in Metody Diskretnogo Analiza v Reshenii Kombinatornykh Zadach, Sbornik trudov Instituta Matematiki SO AN SSSR, Vypusk 34 (1980).
9. A. A. Evdokimov, Locally isometric embeddings of graphs and the metric prolongation property, in Discrete Analysis and Operations Research (A. D. Korshunov, ed.), Kluwer Academic Publishers, Dordrecht/Boston/London (1996).
10. K. J. Kochut, Snake-in-the-box codes for dimension 7, J. Combin. Math. and Combin. Comput., Vol. 20 (1996) pp. 175-185.
11. A. L. Perezhogin, On local isometric coding of natural numbers, Discrete Analysis and Operations Research, Vol. 3 (1996) pp. 69-76 (in Russian).
12. F. P. Preparata and J. Nievergelt, Difference-preserving codes, IEEE Trans. Inform. Theory, Vol. IT-20 (1974) pp. 643-649.
13. H. S. Snevily, The snake-in-the-box problem: A new upper bound, Discrete Math., Vol. 133 (1994) pp. 307-314.
14. A. J. van Zanten, Minimal-change order and separabiblity in linear codes, IEEE Trans. Inform. Theory, Vol. IT-39 (1993) pp. 1988-1989.
15. A. J. van Zanten, Difference-preserving codes, circuit codes and 〈m, n〉-codes, Rept. 94-85, Faculty of Technical Mathematics and Informatics, Delft University of Technology (1994).
16. A. J. van Zanten, On the construction of distance-preserving codes, in Algebraic and Combinatorial Coding Theory, Proceedings of the Fifth International Workshop of the ACCT, Unicorn, Shumen (Bulg.) (1996).
17. G. Zemor, An upper bound on the size of the snake-in-the-box, Combinatorica, Vol. 17 (1997) pp. 1-12.