Optimal Anticodes, Diameter Perfect Codes, Chains and Weights

05/28/2020
by   Luciano Panek, et al.
0

Let P be a poset on [n] = {1,2,...,n}, F^n_q be the linear space of n-tuples over a finite field F_q and w be a weight on F_q. In this paper we consider metrics on F^n_q which are induced by chain orders P over [n] and weights w over F_q. Such family of metrics extend the Niederreiter-Rosenbloom- Tsfasman metrics (when the weight is the Hamming weight). We determine the cardinality and completely classify all optimal anticodes and determine all diameter perfect codes for some instances on these spaces.

READ FULL TEXT

page 1

page 2

page 3

page 4

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...
research
09/01/2021

Non-Binary Diameter Perfect Constant-Weight Codes

Diameter perfect codes form a natural generalization for perfect codes. ...
research
11/30/2022

A family of diameter perfect constant-weight codes from Steiner systems

If S is a transitive metric space, then |C|·|A| ≤ |S| for any distance-d...
research
08/08/2018

Bounds for the diameter of the weight polytope

A weighted game or a threshold function in general admits different weig...
research
11/01/2017

On the complete weight enumerators of some linear codes with a few weights

Linear codes with a few weights have important applications in authentic...
research
11/01/2022

Constructing MRD codes by switching

MRD codes are maximum codes in the rank-distance metric space on m-by-n ...
research
05/04/2022

Weight distribution of random linear codes and Krawchouk polynomials

For 0 < λ < 1 and n →∞ pick uniformly at random λ n vectors in {0,1}^n a...

Please sign up or login with your details

Forgot password? Click here to reset