2000 character limit reached
On Tilings of Asymmetric Limited-Magnitude Balls (2006.00198v2)
Published 30 May 2020 in math.CO, cs.IT, and math.IT
Abstract: We study whether an asymmetric limited-magnitude ball may tile $\mathbb{Z}n$. This ball generalizes previously studied shapes: crosses, semi-crosses, and quasi-crosses. Such tilings act as perfect error-correcting codes in a channel which changes a transmitted integer vector in a bounded number of entries by limited-magnitude errors. A construction of lattice tilings based on perfect codes in the Hamming metric is given. Several non-existence results are proved, both for general tilings, and lattice tilings. A complete classification of lattice tilings for two certain cases is proved.