Further results on multiple coverings of the farthest-off points
DOI10.3934/AMC.2016030zbMATH Open1348.94094OpenAlexW2962686925MaRDI QIDQ326345FDOQ326345
Authors: Daniele Bartoli, Alexander A. Davydov, Massimo Giulietti, Stefano Marcugini, Fernanda Pambianco 
Publication date: 12 October 2016
Published in: Advances in Mathematics of Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/amc.2016030
Recommendations
- Multiple coverings of the farthest-off points with small density from projective geometry
- Bounds for Binary Codes that are Multiple Coverings of the Farthest-Off Points
- Optimal covering points and related problems
- scientific article; zbMATH DE number 5175639
- On the approximability of covering points by lines and related problems
- On the \(C\)-farthest points
- On point covers of multiple intervals and axis-parallel rectangles
- Farthest points and strong convexity of sets
- scientific article; zbMATH DE number 3863852
- On farthest and simultaneous farthest points in Köthe spaces
covering densitycovering codesfarthest-off pointsmultiple coveringssaturating sets in projective spaces
Blocking sets, ovals, (k)-arcs (51E21) Combinatorial codes (94B25) Linear codes and caps in Galois spaces (51E22) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)
Cites Work
- Title not available (Why is that?)
- On the minimum size of complete arcs and minimal saturating sets in projective planes
- On defining sets for projective planes
- The geometry of covering codes: small complete caps and saturating sets in Galois spaces
- New inductive constructions of complete caps in \(\mathrm{PG}(N, q)\), \(q\) even
- Linear nonbinary covering codes and saturating sets in projective spaces
- Small complete caps in PG(N, q), q even
- Title not available (Why is that?)
- Some combinatorial aspects of constructing bipartite-graph codes
- On constructions and parameters of symmetric configurations \(v_k\)
- On small dense sets in Galois planes
- Bounds for binary multiple covering codes
- On the normality of multiple covering codes
- A new table of binary/ternary mixed covering codes
- Multiple coverings of the farthest-off points with small density from projective geometry
- A note on perfect multiple coverings of the Hamming space
- Quasi-Perfect Linear Codes With Minimum Distance $4$
- Title not available (Why is that?)
- Bounds for Binary Codes that are Multiple Coverings of the Farthest-Off Points
- Football Pools--A Game for Mathematicians
- Constructions and families of covering codes and saturated sets of points in projective geometry
- Title not available (Why is that?)
- Title not available (Why is that?)
- On codes with given minimum distance and covering radius
- Upper bounds for football pool problems and mixed covering codes
Cited In (5)
- On planes through points off the twisted cubic in \(\mathrm{PG}(3,q)\) and multiple covering codes
- On the weight distribution of the cosets of MDS codes
- The non-existence of some NMDS codes and the extremal sizes of complete \((n,3)\)-arcs in \(\mathrm{PG}(2,16)\)
- Locally Optimal (Nonshortening) Linear Covering Codes and Minimal Saturating Sets in Projective Spaces
- Multiple coverings of the farthest-off points with small density from projective geometry
This page was built for publication: Further results on multiple coverings of the farthest-off points
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q326345)
