Skip to main content
SpringerLink
Log in

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

  • Published:
Designs, Codes and Cryptography Aims and scope Submit manuscript

Abstract

An ordered list of binary words of length n is called a distance-preserving 〈m, n〉-code, if the list distance between two words is equal to their Hamming distance, for distances up to m. A technique for constructing cyclic 〈m, n〉-codes is presented, based on the standard Gray code and on some simple tools from linear algebra.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. H. L. Abott and M. Katchalski, On the construction of snake-in-the-box codes, Utilitas Math., Vol. 40 (1991) pp. 97-116.

    Google Scholar 

  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.

    Google Scholar 

  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.

    Google Scholar 

  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).

    Google Scholar 

  5. A. A. Evdokimov, Maximal length of a circuit in a unitary n-dimensional cube, Math. Notes, Vol. 6 (1969) pp. 642-648.

    Google Scholar 

  6. A. A. Evdokimov, Circuit codes with arbitrary distance, Soviet Math. Dokl., Vol. 17 (1976) pp. 900-904.

    Google Scholar 

  7. A. A. Evdokimov, O numeratsii podmnozhestv konechnogo mnozhestva (1980), in Metody Diskretnogo Analiza v Reshenii Kombinatornykh Zadach, Sbornik trudov Instituta Matematiki SO AN SSSR, Vypusk 34 (1980).

    Google Scholar 

  8. 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).

    Google Scholar 

  9. K. J. Kochut, Snake-in-the-box codes for dimension 7, J. Combin. Math. and Combin. Comput., Vol. 20 (1996) pp. 175-185.

    Google Scholar 

  10. A. L. Perezhogin, On local isometric coding of natural numbers, Discrete Analysis and Operations Research, Vol. 3 (1996) pp. 69-76 (in Russian).

    Google Scholar 

  11. F. P. Preparata and J. Nievergelt, Difference-preserving codes, IEEE Trans. Inform. Theory, Vol. IT-20 (1974) pp. 643-649.

    Google Scholar 

  12. H. S. Snevily, The snake-in-the-box problem: A new upper bound, Discrete Math., Vol. 133 (1994) pp. 307-314.

    Google Scholar 

  13. A. J. van Zanten, Minimal-change order and separabiblity in linear codes, IEEE Trans. Inform. Theory, Vol. IT-39 (1993) pp. 1988-1989.

    Google Scholar 

  14. 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).

  15. 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).

    Google Scholar 

  16. G. Zemor, An upper bound on the size of the snake-in-the-box, Combinatorica, Vol. 17 (1997) pp. 1-12.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Technical Mathematics and Informatics, Delft University of Technology, P.O. Box 5031, 2600 GA, DELFT, The Netherlands

    A. J. van Zanten & Agung Lukito

Authors
  1. A. J. van Zanten
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Agung Lukito
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zanten, A.J.v., Lukito, A. Construction of Certain Cyclic Distance-Preserving Codes Having Linear-Algebraic Characteristics. Designs, Codes and Cryptography 16, 185–199 (1999). https://doi.org/10.1023/A:1008393130864

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1008393130864

Search

Navigation