Tilings by $(0.5,n)$-Crosses and Perfect Codes

Details Tilings by $(0.5,n)$-Crosses and Perfect Codes Tilings by $(0.5,n)$-Crosses and Perfect Codes

2011-07-28

arxiv.org/abs/1107.5706v1

Mathematics

Combinatorics

Scientific paper

The existence question for tiling of the $n$-dimensional Euclidian space by crosses is well known. A few existence and nonexistence results are known in the literature. Of special interest are tilings of the Euclidian space by crosses with arms of length one, known also as Lee spheres with radius one. Such a tiling forms a perfect code. In this paper crosses with arms of length half are considered. These crosses are scaled by two to form a discrete shape. We prove that an integer tiling for such a shape exists if and only if $n=2^t-1$ or $n=3^t-1$, $t>0$. A strong connection of these tilings to binary and ternary perfect codes in the Hamming scheme is shown.

Affiliated with

Also associated with

No associations

Rating

Tilings by $(0.5,n)$-Crosses and Perfect Codes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Tilings by $(0.5,n)$-Crosses and Perfect Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Tilings by $(0.5,n)$-Crosses and Perfect Codes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-414200