Saturating systems and the rank covering radius

06/29/2022
by   Matteo Bonini, et al.
0

We introduce the concept of a rank saturating system and outline its correspondence to a rank-metric code with a given covering radius. We consider the problem of finding the value of s_q^m/q(k,ρ), which is the minimum 𝔽_q-dimension of a q-system in 𝔽_q^m^k which is rank ρ-saturating. This is equivalent to the covering problem in the rank metric. We obtain upper and lower bounds on s_q^m/q(k,ρ) and evaluate it for certain values of k and ρ. We give constructions of rank ρ-saturating systems suggested from geometry.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/13/2018

The Covering Radius of the Reed--Muller Code RM(2,7) is 40

It was proved by J. Schatz that the covering radius of the second order ...
research
05/19/2023

New bounds for covering codes of radius 3 and codimension 3t+1

The smallest possible length of a q-ary linear code of covering radius R...
research
06/25/2021

The Covering Radius of the Reed-Muller Code RM(m-4,m) in RM(m-3,m)

We present methods for computing the distance from a Boolean polynomial ...
research
01/10/2013

A remark on covering

We discuss construction of coverings of the unit ball of a finite dimens...
research
05/05/2018

Partition-Balanced Families of Codes and Asymptotic Enumeration in Coding Theory

We introduce the class of partition-balanced families of codes, and show...
research
02/05/2023

Quantized-Constraint Concatenation and the Covering Radius of Constrained Systems

We introduce a novel framework for implementing error-correction in cons...
research
02/02/2023

Maximum weight codewords of a linear rank metric code

Let 𝒞⊆𝔽_q^m^n be an 𝔽_q^m-linear non-degenerate rank metric code with di...

Please sign up or login with your details

Forgot password? Click here to reset