scientific article; zbMATH DE number 3728279

MaRDI QIDQ3916581zbMATH OpenFDO

Authors J. R. M. Mason, Raymond Hill

Publication date 1981

zbMATH Keywords

(k,n)-arcpacking problem

Mathematics Subject Classification ID

Combinatorial aspects of finite geometries (05B25) Combinatorial structures in finite projective spaces (51E20)

Recommendations

• A note on (k, n)-arcs
• On (k,n)-arcs
• On the embedding of \((k,p)\)-arcs in maximal arcs
• scientific article; zbMATH DE number 4028268
• An elementary proof and an extension of Thas' theorem on k-arcs
• A Krasnosel'skii-Type Theorem Involving p-ARCS
• On generalized \(k\)-arcs in \( \mathbb{PG} (2n,q)\)
• \(k\)-arcs and dual \(k\)-arcs
• An easier proof of the maximal arcs conjecture
• On the incompleteness of \((k,n)\)-arcs in Desarguesian planes of order \(q\) where \(n\) divides \(q\)

Cited in

(12)

• Arcs and blocking sets. II
• Constructions of large arcs and blocking sets in finite planes
• The packing problem in statistics, coding theory and finite projective spaces
• Arcs, blocking sets, and minihypers
• Lower bounds for complete (k;n)-arcs
• On near-MDS codes
• Bounds on (n,r)-arcs and their application to linear codes
• Geometria combinatoria e geometrie finite
• A new upper bound for the largest complete \((k,n)\)-arc in \(\mathrm{PG}(2,q)\)
• On (k,n)-arcs
• Linear codes close to the Griesmer bound and the related geometric structures
• Affine blocking sets, three-dimensional codes and the Griesmer bound

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3916581)