Projective tilings and full-rank perfect codes (Q6050257)

Let \(\mathbb{S}\) be a vector space over a field \(\mathbb{F}\). A pair \((U, V)\) of subsets of \(\mathbb{S}\) is called a tiling if every element of \(\mathbb{S}\) is uniquely represented as \(\overline{u}+\overline{v}\), \(\overline{u}\in U\), \(\overline{v}\in V\). A subset \(U\subset\mathbb{S}\) is called projective if it is the union of 1-dimensional subspaces \(\mathbb{F}\cdot U = U\). A tiling \((U, V)\) is called projective if both \(U\) and \(V\) are projective and semiprojective if only \(U\) is projective. The author constructs full-rank tilings \((U, V)\) of \(\mathbb{F}^n\) for any field \(\mathbb{F}\) of order larger than 2, such that \(\mathbb{F} \cdot U = U\) (when \(n \geq 6\) even). The same construction is applied when both \(\mathbb{F} \cdot U = U\) and \(\mathbb{F} \cdot V = V\) for \(n\geq 10\) even, which improves a previous known construction for \(n \geq 12\). Also constructed are full-rank 1-perfect codes over \(\mathbb{F}_q\), \(q \geq 3\) with a particular codes that are full-rank 1-perfect codes over \(\mathbb{F}_3^{13}\) with kernel \(3\leq k\leq 7\). The largest value \(k=7\) is constructed as a corollary and the smaller kernels by computer search using the switching approach applied to two coordinates. Lastly, in this work, an interesting reformulation of the connection of projective tilings with factorizations of projective geometries is discussed.