New covering codes of radius R, codimension tR and tR+R2, and saturating sets in projective spaces

Abstract

The length function q(r,R) is the smallest length of a q -ary linear code of codimension r and covering radius R. In this work we obtain new constructive upper bounds on q(r,R) for all R4, r=tR, t2, and also for all even R2, r=tR+R2, t1. The new bounds are provided by infinite families of new covering codes with fixed R and increasing codimension. The new bounds improve upon the known ones. We propose a general regular construction (called ``Line+Ovals'') of a minimal -saturating ((+1)q+1)-set in the projective space PG(2+1,q) for all 0. Such a set corresponds to an [Rq+1,Rq+1-2R,3]qR locally optimal1 code of covering radius R=+1. Basing on combinatorial properties of these codes regarding to spherical capsules1, we give constructions for code codimension lifting and obtain infinite families of new surface-covering1 codes with codimension r=tR, t2. In addition, we obtain new 1-saturating sets in the projective plane PG(2,q2) and, basing on them, construct infinite code families with fixed even radius R2 and codimension r=tR+R2, t1. (1 see the definitions in Section 1)

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…