Further results on multiple coverings of the farthest-off points (Q326345): Difference between revisions

Let \(C\) be a code with covering radius \(R\). This code is a \((R,\mu)\)-multiple covering of the farthest-off points if for every word \(v\) at distance \(R\) from \(C\), there are at least \(\mu\) codewords in the Hamming sphere of radius \(R\) around \(v\). A \((\rho,\mu)\)-saturating set is the geometrical counterpart of a \((\rho+1,\mu)\) multiple covering of the farthest-off code. The authors produce a number of \((1,\mu)\)-saturating sets and the related \((2,\mu)\)-multiple covering of the farthest-off codes. They give upper and lower bounds on the size of \((1,\mu)\)-saturating sets in \(\mathrm{PG}(2,q)\) and give a classification of minimal and optimal \((1,\mu)\) saturating sets in \(\mathrm{PG}(2,q)\) for small values of \(q\).