Metrics which turn tilings into binary perfect codes

03/14/2019
by   Gabriella Akemi Miyamoto, et al.
0

In this work, we consider tilings of the Hamming cube and look for metrics determined by a weight and which is compatible with the support of vectors (TS-metrics) which turn the known tilings into perfect codes. We determine which tilings with small tiles or high rank can be a perfect code for some TS-metric and we characterize all such TS-metrics. Finally, we show some procedures to obtain new perfect codes (it means, new tilings and TS-metrics) using existing ones.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/23/2019

Obtaining binary perfect codes out of tilings

A translation-support metric (TS-metric) is a metric which is translatio...
research
05/28/2020

Optimal Anticodes, Diameter Perfect Codes, Chains and Weights

Let P be a poset on [n] = {1,2,...,n}, F^n_q be the linear space of n-tu...
research
09/01/2021

Non-Binary Diameter Perfect Constant-Weight Codes

Diameter perfect codes form a natural generalization for perfect codes. ...
research
10/11/2021

On q-ary shortened-1-perfect-like codes

We study codes with parameters of q-ary shortened Hamming codes, i.e., (...
research
11/06/2015

Submodular Hamming Metrics

We show that there is a largely unexplored class of functions (positive ...
research
06/10/2023

The Weight Distributions of Two Classes of Linear Codes From Perfect Nonlinear Functions

In this paper, all the possibilities for the value distribution of a per...
research
06/30/2022

Projective tilings and full-rank perfect codes

A tiling of a finite vector space R is the pair (U,V) of its subsets suc...

Please sign up or login with your details

Forgot password? Click here to reset