Pages that link to "Item:Q1922870"
From MaRDI portal
The following pages link to On the size of a triple blocking set in \(\text{PG} (2,q)\) (Q1922870):
Displaying 11 items.
- The packing problem in statistics, coding theory and finite projective spaces (Q1299059) (← links)
- On the size of a double blocking set in \(\text{PG}(2,q)\) (Q1383492) (← links)
- On the upper embedding of symmetric configurations with block size 3 (Q2297727) (← links)
- Bounds on \((n,r)\)-arcs and their application to linear codes (Q2566171) (← links)
- (Q3790206) (← links)
- Lacunary Polynomials, Multiple Blocking Sets and Baer Subplanes (Q3839893) (← links)
- (Q3973713) (← links)
- (Q4390648) (← links)
- (Q4964832) (← links)
- A new upper bound for the largest complete \boldmath(𝑘,𝑛)-arc in \boldmath𝑃𝐺(2,𝑞) (Q5043425) (← links)
- On 1-blocking sets in \(PG(n,q), n\geq 3\) (Q5926327) (← links)
