scientific article; zbMATH DE number 3823809

zbMATH Open0521.05020MaRDI QIDQ3671186FDOQ3671186

Authors: J. W. P. Hirschfeld 

Publication date: 1983

Title of this publication is not available (Why is that?)

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)

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

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)