The following pages link to (Q3319338):
Displaying 14 items.
- Upper bounds on the smallest size of a complete arc in a finite Desarguesian projective plane based on computer search (Q265614) (← links)
- On sizes of complete arcs in \(PG(2,q)\) (Q658122) (← links)
- Small arcs in projective spaces (Q678205) (← links)
- Random constructions and density results (Q1009013) (← links)
- On the maximality of linear codes (Q1035807) (← links)
- Small complete arcs in Galois planes (Q1059272) (← links)
- Note on the order of magnitude of k for complete k-arcs in PG(2,q) (Q1091608) (← links)
- On the spectrum of the values \(k\) for which a complete \(k\)-cap in \(PG(n,q)\) exists (Q1266486) (← links)
- The packing problem in statistics, coding theory and finite projective spaces (Q1299059) (← links)
- On saturating sets in small projective geometries (Q1580668) (← links)
- Large \(k\)-arcs in inversive planes of odd order (Q1818910) (← links)
- New upper bounds on the smallest size of a complete arc in a finite Desarguesian projective plane (Q1956326) (← links)
- New types of estimates for the smallest size of complete arcs in a finite Desarguesian projective plane (Q2352466) (← links)
- Upper bounds on the smallest size of a complete arc in \(\mathrm{PG}(2, {q})\) under a certain probabilistic conjecture (Q2352635) (← links)
