Further results on binary codes of covering radius 2 and saturating sets in projective spaces

2026-09-13

AI Summary

本文解决了二进制码覆盖半径为2的问题，通过构建新的无限码族和使用不同的q^m-连接构造方法，得到了更优的上界。

Abstract

The length function $\ell_2(r,R)$ is the smallest length of a binary linear code with codimension (redundancy) $r$ and covering radius $R$. Let $s_2(N,ρ)$ be the smallest size of a $ρ$-saturating set in the projective space $\mathrm{PG}(N,2)$. It is known that $\ell_2(r,R)=s_2(r-1,R-1)$. We obtain the following new upper bounds on $\ell_2(r,2)$, which yield a decrease $Δ(r,2)$ compared to the best previously known upper bounds: $r=2t,r=10,18,20$ and $r\ge28,\ell_2(r,2)=s_2(r-1,1)\le51\cdot2^{r/2-5}-1;Δ(r,2)=2^{r/2-5}$. To obtain these bounds, we construct a new infinite code family, using distinct versions of the $q^m$-concatenating constructions of covering codes; some of these versions are proposed in this paper. We also obtain new useful partitions of column sets of parity check matrices of some codes. The asymptotic covering density $\overlineμ(2)\le1.27002$, provided by the codes of the new family, is smaller than previously known one and gives rise to the new upper bound $f(2)\le1.27002$ on the constant $f(2)$ of the Green's Open Problem 40.

Problem

• covering radius
• saturating set
• binary linear code
• projective space

Innovation

• new infinite code family
• q^m-concatenating constructions
• covering codes
• asymptotic covering density
• Green's Open Problem 40