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

DOI10.1007/s10623-008-9202-xzbMath1196.94089OpenAlexW2126257027MaRDI QIDQ1009043

Loeky Haryanto, A. J. van Zanten

Publication date: 31 March 2009

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-008-9202-x

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Combinatorial codes (94B25)

Related Items (1)

2-Factors Without Close Edges in the n-Dimensional Cube

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Construction of certain cyclic distance-preserving codes having linear-algebraic characteristics
• The snake-in-the-box problem: A new upper bound
• Covering the hypercube with a bounded number of disjoint snakes
• An upper bound on the size of the snake-in-the-box
• On the maximal length of a snake in hypercubes of small dimension
• Minimal-change order and separability in linear codes
• Some new circuit codes
• A Method for Constructing Circuit Codes
• The Two-Triangle Case of the Acquaintance Graph

This page was built for publication: Sets of disjoint snakes based on a Reed-Muller code and covering the hypercube