# Further results on multiple coverings of the farthest-off points

@article{Bartoli2015FurtherRO,
title={Further results on multiple coverings of the farthest-off points},
author={Daniele Bartoli and Alexander A. Davydov and Massimo Giulietti and Stefano Marcugini and Fernanda Pambianco},
journal={Adv. Math. Commun.},
year={2015},
volume={10},
pages={613-632}
}
• Published 1 June 2015
• Mathematics, Computer Science
• Adv. Math. Commun.
Multiple coverings of the farthest-off points ($(R,\mu)$-MCF codes) and the corresponding $(\rho,\mu)$-saturating sets in projective spaces $PG(N,q)$ are considered. We propose and develop some methods which allow us to obtain new small $(1,\mu)$-saturating sets and short $(2,\mu)$-MCF codes with $\mu$-density either equal to 1 (optimal saturating sets and almost perfect MCF-codes) or close to 1 (roughly $1+1/cq$, $c\ge1$). In particular, we provide new algebraic constructions and some bounds…
5 Citations

## Tables from this paper

• Mathematics
• 2019
Let $\mathrm{PG}(3,q)$ be the projective space of dimension three over the finite field with $q$ elements. Consider a twisted cubic in $\mathrm{PG}(3,q)$. The structure of the point-plane incidence
• Computer Science
2016 XV International Symposium Problems of Redundancy in Information and Control Systems (REDUNDANCY)
• 2016
Upper bounds on the smallest size of a saturating set (as well as on a (1, μ)-saturating set) in the projective space PG(N, q) are obtained by using inductive constructions.
• Computer Science
IEEE Transactions on Information Theory
• 2021
It is proved that the difference between the w-th components of the distributions is uniquely determined by the Difference between the 3-rd components, which implies an interesting (and in some sense unexpected) symmetry of the obtained distributions.
• Computer Science
Advances in Mathematics of Communications
• 2021
The Bonneau formula is transformed into a more structured and convenient form and it is proved that all the cosets of weight of the MDS code have the same weight distribution.

## References

SHOWING 1-10 OF 34 REFERENCES

• Computer Science, Mathematics
Adv. Math. Commun.
• 2015
A natural extension of the notion of density for ordinary covering codes, that is the $\mu$-density for MCF codes, is used; a generalization of the length function for linear covering codes is introduced and a number of upper bounds on such a length function are obtained.
• Computer Science, Mathematics
SIAM J. Discret. Math.
• 1995
The minimum possible cardinality $F(n,r, \mu)$ of such a code is studied and tables of upper bounds on $F (n, r, 𝕂)$ for $n \leq 16, r \lequ 4, Â£4$ are given.
• Mathematics
Adv. Math. Commun.
• 2011
The key tool in the investigation is the design of new small saturating sets in projective spaces over finite fields, which are used as the starting point for the $q$m-concatenating constructions of covering codes.
For the kind of coverings codes called multiple coverings of the farthestoff points (MCF), μ-density is defined as a characteristic of quality and a number of results on the spectrum of sizes of minimal (1, μ)-saturating sets are obtained.
• Mathematics, Computer Science
Electron. Notes Discret. Math.
• 2013
• Computer Science
Des. Codes Cryptogr.
• 1993
K(n, r, μ), the minimum cardinality of a binary code of lengthn such that the Hamming spheres of radiusr centered at the codewords cover at least μ times is discussed.
• A. Davydov
• Computer Science
IEEE Trans. Inf. Theory
• 1995
The author proposes to use saturated sets of points in projective geometries over finite fields as parity check matrices of starting codes for q-ary linear nonbinary covering codes, q/spl ges/3, and new constructions are proposed.
In several cases, an improvement on the best known upper bound on the size of the smallest dense set inPG(2,q)\$ is obtained.
• Computer Science, Mathematics
IEEE Transactions on Information Theory
• 2007
As quasi-perfect [n,n-m,4]q-codes and complete n-caps in projective spaces PG(m-1,q) are equivalent objects, new upper bounds on the size of the smallest complete cap in PG( m- 1,q), obtained.