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

12/19/2017
by   Daniele Bartoli, et al.
0

The length function ℓ_q(r,R) is the smallest length of a q -ary linear code of covering radius R and codimension r. In this work, by computer search in wide regions of q, we obtained short [n,n-4,5]_q3 quasiperfect MDS codes and [n,n-5,5]_q3 quasiperfect Almost MDS codes with covering radius R=3. The new codes imply the following upper bounds: &ℓ_q(4,3)<2.8√(q q) for 8< q<3323 and q=3511,3761,4001; &ℓ_q(5,3)<3√(q^2 q) for 5< q<563. For r≠ 3t and q≠ (q^')^3, the new bounds have the form ℓ_q(r,3)< c√( q)· q^(r-3)/3, c is a universal constant, r=4,5. As far as it is known to the authors, such bounds have not been previously described in the literature. In computer search, we use the leximatrix algorithm to obtain parity check matrices of codes. The algorithm is a version of the recursive g-parity check algorithm for greedy codes.

READ FULL TEXT

page 10

page 11

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
08/31/2021

Upper bounds on the length function for covering codes

The length function ℓ_q(r,R) is the smallest length of a q-ary linear co...
research
11/01/2021

On the number of q-ary quasi-perfect codes with covering radius 2

In this paper we present a family of q-ary nonlinear quasi-perfect codes...
research
01/29/2021

On the weight distribution of the cosets of MDS codes

The weight distribution of the cosets of maximum distance separable (MDS...
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
07/05/2020

On integral weight spectra of the MDS codes cosets of weight 1, 2, and 3

The weight of a coset of a code is the smallest Hamming weight of any ve...
research
07/31/2022

Bounds on Covering Codes in RT spaces using Ordered Covering Arrays

In this work, constructions of ordered covering arrays are discussed and...

Please sign up or login with your details

Forgot password? Click here to reset