Further results on multiple coverings of the farthest-off points · Daniele Bartoli 1, , · Alexander A. Davydov 2, , · Massimo Giulietti 3, , · Stefano Marcugini 3, ...
May 30, 2024 · Multiple coverings of the farthest-off points ($(R,\mu)$-MCF codes) and the corresponding $(\rho,\mu)$-saturating sets in projective spaces ...
In this paper we deal with the special class of covering codes consisting of multiple coverings of the farthest-off points (MCF). In order to measure the ...
May 15, 2013 · We define μ-density as a characteristic of quality for the kind of coverings codes called multiple coverings of the farthest-off points (MCF). A ...
Missing: Further | Show results with:Further
Abstract. In this paper we deal with the special class of covering codes con- sisting of multiple coverings of the farthest-off points (MCF).
Missing: Further | Show results with:Further
Further results on multiple coverings of the farthest-off points. Article. Full-text available. Jun 2015. Daniele Bartoli ...
A binary code C ⊆ F 2 n with M codewords is called an ( n , M , r , u ) multiple covering of the farthest-off points (MCF) if the Hamming spheres of radius ...
Marcugini, Multiple coverings of the farthest-off points and multiple saturating sets in projective spaces, Proceedings of ACCT 2012, Thirteenth ...
... Further results on the covering radius of codes, ... Ostergard, Bounds for binary codes that are multiple coverings of the farthest-off points, SIAM J.
We study codes that are multiple coverings of the Hamming space F 2 n and discuss lower and upper bounds onK(n, r, μ), the minimum cardinality of a binary ...