Covering and packing problems in lattices associated with the n-cube

Authors:
Horst Martini;Walter Wenzel
Affiliations:
Technische Universität Chemnitz, Fakultät für Mathematik, 09107 Chemnitz, Germany;Technische Universität Chemnitz, Fakultät für Mathematik, 09107 Chemnitz, Germany
Venue:
European Journal of Combinatorics
Year:
2002

Citing 2
Cited 0

Introduction to the theory of neural computation

Introduction to the theory of neural computation
Regular Article: Hyperplane Arrangements Separating Arbitrary Vertex Classes in n-Cubes

Advances in Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study optimal coverings of lattices associated with a given n-cube by frames (= Hamming spheres of radius one) and extended frames under certain constraints, e.g., by constituting at the same time packings of the edge system in such finite lattices. These investigations also yield results on different types of packings and coverings of the n-cube by rectangular simplices whose vertices are taken from the vertex set of the cube.