On the classification of completely regular codes with covering radius two and antipodal dual

02/21/2023
by   J. Borges, et al.
0

We classify all linear completely regular codes which have covering radius ρ = 2 and whose dual are antipodal. For this, we firstly show several properties of such dual codes, which are two-weight codes.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/07/2018

On completely regular codes of covering radius 1 in the halved hypercubes

We consider constructions of covering-radius-1 completely regular codes,...
research
12/13/2020

Completely regular codes in Johnson and Grassmann graphs with small covering radii

Let L be a Desarguesian 2-spread in the Grassmann graph J_q(n,2). We pro...
research
12/23/2019

On metric regularity of Reed-Muller codes

In this work we study metric properties of the well-known family of bina...
research
10/20/2022

On completely regular codes with minimum eigenvalue in geometric graphs

We prove that any completely regular code with minimum eigenvalue in any...
research
03/20/2023

On new infinite families of completely regular and completely transitive codes

In two previous papers we constructed new families of completely regular...
research
02/24/2022

An Algorithm for Computing the Covering Radius of a Linear Code Based on Vilenkin-Chrestenson Transform

We present a generalization of Walsh-Hadamard transform that is suitable...
research
12/19/2017

Tables, bounds and graphics of short linear codes with covering radius 3 and codimension 4 and 5

The length function ℓ_q(r,R) is the smallest length of a q -ary linear ...

Please sign up or login with your details

Forgot password? Click here to reset