The packing problem in statistics, coding theory and finite projective spaces

From MaRDI portal
Publication:1299059

DOI10.1016/S0378-3758(98)00043-3zbMath0958.51013WikidataQ127088957 ScholiaQ127088957MaRDI QIDQ1299059

J. W. P. Hirschfeld, Storme, L.

Publication date: 28 January 2001

Published in: Journal of Statistical Planning and Inference (Search for Journal in Brave)




Related Items (36)

Projective planes and congestion-free networksUpper bounds on the smallest size of a complete arc in a finite Desarguesian projective plane based on computer searchComplete \((k,3)\)-arcs from quartic curvesSome constructions of quantum MDS codesA geometric approach to classifying Griesmer codesOn critical exponents of Dowling matroidsCaps in finite projective spaces of odd orderComplete arcs and caps in some papers of Giuseppe Tallini and Walking with Giuseppe Tallini along the streets of ``Augusta PerusiaComplete \((k,4)\)-arcs from quintic curvesOn complete \(m\)-arcsAlgebraic constructions of complete \(m\)-arcsDetecting arrays for effects of single factorsConstructing heterogeneous hash families by puncturing linear transversal designsOn saturating sets in projective spaces.On the minimum number of minimal codewordsNew upper bounds on the smallest size of a complete arc in a finite Desarguesian projective planeConics and capsOn sizes of complete arcs in \(PG(2,q)\)On complete caps in the projective geometries over \(\mathbb F_3\)Caps on classical varieties and their projectionsNew inductive constructions of complete caps inPG(N, q),qevenSmall complete caps from singular cubics. IIRecursive constructions of complete capsThe geometric description of a cyclic \((q- \sqrt{q}+1)\)-arc in \(\text{PG} (q-\sqrt{q}-3,q)\), \(q\) squareExistence of canonically inherited arcs in Moulton planes of odd orderLinear codes with covering radius 3Open problems in finite projective spacesOn proper secrets, \((t,k)\)-bases and linear codesUpper bounds on the smallest size of a complete cap in $\mathrm{PG}(N,q)$, $N\ge3$, under a certain probabilistic conjectureOn sizes of complete caps in projective spaces \(\mathrm{PG}(n, q)\) and arcs in planes \(\mathrm{PG}(2, q)\)New bounds for linear codes of covering radii 2 and 3Computer search for small complete capsNew covering codes of radius \(R\), codimension \(tr\) and \(tr+\frac{R}{2}\), and saturating sets in projective spacesOn the largest caps contained in the Klein quadric of \(PG(5,q)\), \(q\) oddA family of caps in projective 4-space in odd characteristicUpper bounds on the smallest size of a complete arc in \(\mathrm{PG}(2, {q})\) under a certain probabilistic conjecture



Cites Work


This page was built for publication: The packing problem in statistics, coding theory and finite projective spaces