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

10/11/2021
by   Minjia Shi, et al.
0

We study codes with parameters of q-ary shortened Hamming codes, i.e., (n=(q^m-q)/(q-1), q^n-m, 3)_q. At first, we prove the fact mentioned in [A.E.Brouwer et al. Bounds on mixed binary/ternary codes. IEEE Trans. Inf. Theory 44 (1998) 140-161] that such codes are optimal, generalizing it to a bound for multifold packings of radius-1 balls, with a corollary for multiple coverings. In particular, we show that the punctured Hamming code is an optimal q-fold packing with minimum distance 2. At second, we show the existence of 4-ary codes with parameters of shortened 1-perfect codes that cannot be obtained by shortening a 1-perfect code. Keywords: Hamming graph; multifold packings; multiple coverings; perfect codes.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/07/2022

Multifold 1-perfect codes

A μ-fold (multifold) 1-perfect code in any graph is a set C of vertices ...
research
10/12/2021

An enumeration of 1-perfect ternary codes

We study codes with parameters of the ternary Hamming (n,3^n-m,3) code, ...
research
02/04/2018

Weighted Hamming Metric Structures

A weighted Hamming metric is introduced in [4] and it showed that the bi...
research
01/31/2019

On two-fold packings of radius-1 balls in Hamming graphs

A λ-fold r-packing in a Hamming metric space is a code C such that the r...
research
12/19/2019

On existence of perfect bitrades in Hamming graphs

A pair (T_0,T_1) of disjoint sets of vertices of a graph G is called a p...
research
02/23/2023

On the non-existence of perfect codes in the NRT-metric

In this paper we consider codes in 𝔽_q^s× r with packing radius R regard...
research
03/14/2019

Metrics which turn tilings into binary perfect codes

In this work, we consider tilings of the Hamming cube and look for metri...

Please sign up or login with your details

Forgot password? Click here to reset