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

12/07/2018
by   Denis S. Krotov, et al.
0

We consider constructions of covering-radius-1 completely regular codes, or, equivalently, equitable 2-partitions (regular 2-partitions, perfect 2-colorings), of halved n-cubes. Keywords: completely regular code, equitable partition, regular partition, partition design, perfect coloring, halved hypercube.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/21/2023

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

We classify all linear completely regular codes which have covering radi...
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/07/2022

Multifold 1-perfect codes

A μ-fold (multifold) 1-perfect code in any graph is a set C of vertices ...
research
02/21/2022

(Dis)assortative Partitions on Random Regular Graphs

We study the problem of assortative and disassortative partitions on ran...
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
12/23/2019

On metric regularity of Reed-Muller codes

In this work we study metric properties of the well-known family of bina...

Please sign up or login with your details

Forgot password? Click here to reset