The following pages link to (Q3671186):
Displaying 20 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)
- Constructions of large arcs and blocking sets in finite planes (Q1180796) (← links)
- Polynomial representations of complete sets of frequency hyperrectangles with prime power dimensions (Q1208039) (← 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)
- Complete arcs (Q1377799) (← links)
- Small complete caps in \(PG(r,q)\), \(r\geq 3\) (Q1377807) (← links)
- Arcs, blocking sets, and minihypers (Q1570114) (← links)
- On saturating sets in small projective geometries (Q1580668) (← links)
- Projective planes and congestion-free networks (Q1613417) (← links)
- New upper bounds on the smallest size of a complete arc in a finite Desarguesian projective plane (Q1956326) (← links)
- A construction of maximal linearly independent array (Q1956505) (← links)
- Linear codes with covering radius 3 (Q2267791) (← links)
- New types of estimates for the smallest size of complete arcs in a finite Desarguesian projective plane (Q2352466) (← links)
- Open problems in finite projective spaces (Q2512884) (← links)
- The main conjecture for MDS codes (Q4608496) (← links)
- Recursive constructions of complete caps (Q5935436) (← links)
- Qualitative and asymptotic analysis of repulsion systems with diverse applications (Q6609871) (← links)
- On the maximum size of ultrametric orthogonal sets over discrete valued fields (Q6651902) (← links)
