scientific article; zbMATH DE number 3823809

MaRDI QIDQ3671186zbMATH OpenFDO

Authors J. W. P. Hirschfeld

Publication date 1983

zbMATH Keywords

error correcting codesk-set(k,n)-arcsymmetrical factorial designs(k,n)-cap

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Combinatorial aspects of finite geometries (05B25) Combinatorial structures in finite projective spaces (51E20)

Cited in

(20)

• A construction of maximal linearly independent array
• Recursive constructions of complete caps
• New upper bounds on the smallest size of a complete arc in a finite Desarguesian projective plane
• Polynomial representations of complete sets of frequency hyperrectangles with prime power dimensions
• On the maximum size of ultrametric orthogonal sets over discrete valued fields
• Qualitative and asymptotic analysis of repulsion systems with diverse applications
• The main conjecture for MDS codes
• On saturating sets in small projective geometries
• Complete arcs
• Projective planes and congestion-free networks
• Arcs, blocking sets, and minihypers
• New types of estimates for the smallest size of complete arcs in a finite Desarguesian projective plane
• Small complete caps in \(PG(r,q)\), \(r\geq 3\)
• On the spectrum of the values \(k\) for which a complete \(k\)-cap in \(PG(n,q)\) exists
• Linear codes with covering radius 3
• On sizes of complete arcs in \(PG(2,q)\)
• The packing problem in statistics, coding theory and finite projective spaces
• Upper bounds on the smallest size of a complete arc in a finite Desarguesian projective plane based on computer search
• Open problems in finite projective spaces
• Constructions of large arcs and blocking sets in finite planes

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 Q3671186)