Abstract
Multiple coverings of the farthest-off points (-MCF codes) and the corresponding -saturating sets in projective spaces are considered. We propose and develop some methods which allow us to obtain new small -saturating sets and short -MCF codes with -density either equal to 1 (optimal saturating sets and almost perfect MCF-codes) or close to 1 (roughly , ). In particular, we provide new algebraic constructions and some bounds. Also, we classify minimal and optimal -saturating sets in , small.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.