The following pages link to (Q3916581):
Displaying 11 items.
- Linear codes close to the Griesmer bound and the related geometric structures (Q670207) (← links)
- Affine blocking sets, three-dimensional codes and the Griesmer bound (Q879336) (← links)
- Arcs and blocking sets. II (Q1099408) (← links)
- Constructions of large arcs and blocking sets in finite planes (Q1180796) (← links)
- The packing problem in statistics, coding theory and finite projective spaces (Q1299059) (← links)
- Arcs, blocking sets, and minihypers (Q1570114) (← links)
- Lower bounds for complete \((k;n)\)-arcs (Q1838488) (← links)
- On near-MDS codes (Q1904252) (← links)
- Bounds on \((n,r)\)-arcs and their application to linear codes (Q2566171) (← links)
- Geometria combinatoria e geometrie finite (Q3218706) (← links)
- A new upper bound for the largest complete \boldmath(𝑘,𝑛)-arc in \boldmath𝑃𝐺(2,𝑞) (Q5043425) (← links)
