# Sets of disjoint snakes based on a Reed-Muller code and covering the hypercube
> Van Zanten A.J.

URL kanonis: https://discover.unhas.ac.id/publications/sets-of-disjoint-snakes-based-on-a-reed-muller-code-and-covering-the-hypercube
Jurnal / Konferensi: Designs Codes and Cryptography
Tahun terbit: 2008
DOI: https://doi.org/10.1007/s10623-008-9202-x
Kuartil SJR: Q1
Citations: 2

## Authors
- Van Zanten A.J.

## Abstract
A snake-in-the-box code (or snake) of word length n is a simple circuit in an n-dimensional cube Q n , with the additional property that any two non-neighboring words in the circuit differ in at least two positions. To construct such snakes a straightforward, non-recursive method is developed based on special linear codes with minimum distance 4. An extension of this method is used for the construction of covers of Q n consisting of 2 m-1 vertex-disjoint snakes, for 2 m-1 < n ≤ 2 m . These covers turn out to have a symmetry group of order 2 m .

---
Sumber: Discover Unhas — RIMS Universitas Hasanuddin.
Saat mengutip, gunakan DOI bila tersedia atau URL kanonis di atas.