Sets of disjoint snakes based on a Reed-Muller code and covering the hypercube

Authors:
A. J. Zanten;Loeky Haryanto
Affiliations:
Faculty of Electrical Engineering, Mathematics and Computer Science, Delft University of Technology, Delft, The Netherlands 2600 GA;Department of Mathematics, Hasanuddin University, Makassar, Indonesia 90245
Venue:
Designs, Codes and Cryptography
Year:
2008

Citing 7
Cited 0

The snake-in-the-box problem: a new upper bound

Discrete Mathematics
Using the genetic algorithm to find snake-in-the-box codes

IEA/AIE '94 Proceedings of the 7th international conference on Industrial and engineering applications of artificial intelligence and expert systems
Construction of Certain Cyclic Distance-Preserving CodesHaving Linear-Algebraic Characteristics

Designs, Codes and Cryptography
A Method for Constructing Circuit Codes

Journal of the ACM (JACM)
On the maximal length of a snake in hypercubes of small dimension

Discrete Mathematics
The Art of Computer Programming, Volume 4, Fascicle 2: Generating All Tuples and Permutations (Art of Computer Programming)

The Art of Computer Programming, Volume 4, Fascicle 2: Generating All Tuples and Permutations (Art of Computer Programming)
Some new circuit codes

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

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 .