The aim of the project is to investigate geometric and combinatorial properties of the so-called hypercube (generalization of the usual 3D cube to d dimensions). Emphasis is laid on the intersection of the hypercube with various hyperplanes. Since the vertices of the hypercube constitute a compact representation of all possible binary strings of length d, applications of the results arise in coding theory and binary string searching.
Explore the research topics touched on by this project. These labels are generated based on the underlying awards/grants. Together they form a unique fingerprint.