On the structure of cube tiling codes

From MaRDI portal
Publication:2198994



Abstract: Let S be a set of arbitrary objects, and let Sd=v1...vdcolonviinS. A polybox code is a set VsubsetSd with the property that for every two words v,winV there is iin[d] with vi′=wi, where a permutation smapstos′ of S is such that s″=(s′)′=s and s′eqs. If |V|=2d, then V is called a cube tiling code. Cube tiling codes determine 2-periodic cube tilings of mathbbRd or, equivalently, tilings of the flat torus mathbbTd=(x1,ldots,xd)(mmod2):(x1,ldots,xd)inmathbbRd by translates of the unit cube as well as r-perfect codes in mathbbZ4r+2d in the maximum metric. By a structural result, cube tiling codes for d=4 are enumerated. It is computed that there are 27,385 non-isomorphic cube tiling codes in dimension four, and the total number of such codes is equal to 17,794,836,080,455,680. Moreover, some procedure of passing from a cube tiling code to a cube tiling code in dimensions dleq5 is given.












This page was built for publication: On the structure of cube tiling codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2198994)