Obtaining Binary Perfect Codes Out of Tilings

DOI10.1109/TIT.2020.2988865MaRDI QIDQ5138798zbMATH OpenOpenAlexFDO

Authors Gabriella Akemi Miyamoto, Marcelo Firer

Publication date 4 December 2020

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1904.10789

zbMATH Keywords

TS-perfect codes

Mathematics Subject Classification ID

Combinatorial aspects of tessellation and tiling problems (05B45) Linear codes (general theory) (94B05)

Abstract: A tiling of the $n$-dimensional Hamming cube gives rise to a perfect code (according to a given metric) if the basic tile is a metric ball. We are concerned with metrics on the $n$-dimensional Hamming cube which are determined by a weight which respects support of vectors (TS-metrics). We consider the known tilings of the Hamming cube and first determine which of them give rise to a perfect code. In the sequence, for those tilings that satisfy this condition, we determine all the TS-metrics that turns it into a perfect code. We also propose the construction of new perfect codes obtained by the concatenation of two smaller ones.

Cited in

(1)

• Reducing the local alphabet size in tiling systems by means of 2D comma-free codes

This page was built for publication: Obtaining Binary Perfect Codes Out of Tilings

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