Abstract

Multiple coverings of the farthest-off points ((R,μ)(R,μ)-MCF codes) and the corresponding (ρ,μ)(ρ,μ)-saturating sets in projective spaces PG(N,q)PG(N,q) are considered. We propose and develop some methods which allow us to obtain new small (1,μ)(1,μ)-saturating sets and short (2,μ)(2,μ)-MCF codes with μμ-density either equal to 1 (optimal saturating sets and almost perfect MCF-codes) or close to 1 (roughly 1+1/cq1+1/cq, c≥1c\ge1). In particular, we provide new algebraic constructions and some bounds. Also, we classify minimal and optimal (1,μ)(1,μ)-saturating sets in PG(2,q)PG(2,q), qq small.

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 reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.