scientific article

zbMath0521.05020MaRDI QIDQ3671186

J. W. P. Hirschfeld

Publication date: 1983

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

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)

Related Items (18)

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

This page was built for publication: