Pages that link to "Item:Q1383492"
From MaRDI portal
The following pages link to On the size of a double blocking set in \(\text{PG}(2,q)\) (Q1383492):
Displaying 17 items.
- Search problems in vector spaces (Q498971) (← links)
- On the metric dimension of imprimitive distance-regular graphs (Q505687) (← links)
- Translation hyperovals and \(\mathbb{F}_2\)-linear sets of pseudoregulus type (Q785569) (← links)
- Small weight codewords in the codes arising from Desarguesian projective planes (Q1008962) (← links)
- Algebraic curves and maximal arcs (Q1016028) (← links)
- Blocking sets in Desarguesian affine and projective planes (Q1266422) (← links)
- The packing problem in statistics, coding theory and finite projective spaces (Q1299059) (← links)
- Blocking sets of almost Rédei type (Q1356024) (← links)
- Combinatorial repairability for threshold schemes (Q1692160) (← links)
- On the size of a triple blocking set in \(\text{PG} (2,q)\) (Q1922870) (← links)
- A geometric characterization of minimal codes and their asymptotic performance (Q2070261) (← links)
- Double blocking sets of size \(3 q - 1\) in \(\operatorname{PG}(2, q)\) (Q2422213) (← links)
- Bounds on \((n,r)\)-arcs and their application to linear codes (Q2566171) (← links)
- The non-existence of certain large minimal blocking sets (Q4223756) (← links)
- On resolving sets in the point-line incidence graph of PG(n, q) (Q4993956) (← links)
- Three Combinatorial Perspectives on Minimal Codes (Q5062110) (← links)
- The 2‐Blocking Number and the Upper Chromatic Number of <i>PG</i>(2,<i>q</i>) (Q5411948) (← links)
