Pages that link to "Item:Q265614"
From MaRDI portal
The following pages link to Upper bounds on the smallest size of a complete arc in a finite Desarguesian projective plane based on computer search (Q265614):
Displayed 6 items.
- Upper bounds on the smallest size of a complete arc in a finite Desarguesian projective plane based on computer search (Q265614) (← links)
- Saturating sets in projective planes and hypergraph covers (Q1699553) (← links)
- On the smallest size of an almost complete subset of a conic in \(\mathrm{PG}(2, q)\) and extendability of Reed-Solomon codes (Q2314145) (← links)
- New bounds for linear codes of covering radii 2 and 3 (Q2325293) (← links)
- Upper bounds on the smallest size of a complete arc in \(\mathrm{PG}(2, {q})\) under a certain probabilistic conjecture (Q2352635) (← links)
- Upper bounds on the smallest size of a complete cap in $\mathrm{PG}(N,q)$, $N\ge3$, under a certain probabilistic conjecture (Q4622636) (← links)