Pages that link to "Item:Q2512884"
From MaRDI portal
The following pages link to Open problems in finite projective spaces (Q2512884):
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 Minkowski space and finite geometry (Q507825) (← links)
- Counting arcs in projective planes via Glynn's algorithm (Q1685543) (← links)
- Locally recoverable codes correcting many erasures over small fields (Q1981796) (← links)
- On planes through points off the twisted cubic in \(\mathrm{PG}(3,q)\) and multiple covering codes (Q1994925) (← links)
- An algorithm for counting arcs in higher-dimensional projective space (Q2123300) (← links)
- Twisted cubic and point-line incidence matrix in \(\operatorname{PG}(3,q)\) (Q2232117) (← 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)
- Upper bounds on the smallest size of a complete cap in $\mathrm{PG}(N,q)$, $N\ge3$, under a certain probabilistic conjecture (Q4622636) (← links)
- Lower and upper bounds for some generalized arcs (Q4998840) (← links)
- Exponentially larger affine and projective caps (Q6075460) (← links)
- Upper bounds on the length function for covering codes with covering radius \(R\) and codimension \(tR+1\) (Q6112225) (← links)
- On the weight distribution of the cosets of MDS codes (Q6163789) (← links)
- Geometry of smooth extremal surfaces (Q6196144) (← links)
