Pages that link to "Item:Q1299059"
From MaRDI portal
The following pages link to The packing problem in statistics, coding theory and finite projective spaces (Q1299059):
Displaying 31 items.
- Upper bounds on the smallest size of a complete arc in a finite Desarguesian projective plane based on computer search (Q265614) (← links)
- Complete \((k,3)\)-arcs from quartic curves (Q281309) (← links)
- Constructing heterogeneous hash families by puncturing linear transversal designs (Q408964) (← links)
- Conics and caps (Q657009) (← links)
- On sizes of complete arcs in \(PG(2,q)\) (Q658122) (← links)
- On proper secrets, \((t,k)\)-bases and linear codes (Q735016) (← links)
- Some constructions of quantum MDS codes (Q831170) (← links)
- On sizes of complete caps in projective spaces \(\mathrm{PG}(n, q)\) and arcs in planes \(\mathrm{PG}(2, q)\) (Q1037215) (← links)
- On the largest caps contained in the Klein quadric of \(PG(5,q)\), \(q\) odd (Q1304630) (← links)
- Caps in finite projective spaces of odd order (Q1365034) (← links)
- Complete arcs and caps in some papers of Giuseppe Tallini and Walking with Giuseppe Tallini along the streets of ``Augusta Perusia'' (Q1378911) (← links)
- On saturating sets in projective spaces. (Q1399903) (← links)
- A family of caps in projective 4-space in odd characteristic (Q1590971) (← links)
- Projective planes and congestion-free networks (Q1613417) (← links)
- On critical exponents of Dowling matroids (Q1650807) (← links)
- Complete \((k,4)\)-arcs from quintic curves (Q1685539) (← links)
- Computer search for small complete caps (Q1841870) (← links)
- New upper bounds on the smallest size of a complete arc in a finite Desarguesian projective plane (Q1956326) (← links)
- On complete caps in the projective geometries over \(\mathbb F_3\) (Q1976895) (← links)
- Existence of canonically inherited arcs in Moulton planes of odd order (Q2011491) (← links)
- Small complete caps from singular cubics. II (Q2256060) (← links)
- Linear codes with covering radius 3 (Q2267791) (← links)
- New bounds for linear codes of covering radii 2 and 3 (Q2325293) (← links)
- New covering codes of radius \(R\), codimension \(tr\) and \(tr+\frac{R}{2}\), and saturating sets in projective spaces (Q2334437) (← links)
- Upper bounds on the smallest size of a complete arc in \(\mathrm{PG}(2, {q})\) under a certain probabilistic conjecture (Q2352635) (← links)
- A geometric approach to classifying Griesmer codes (Q2384039) (← links)
- Open problems in finite projective spaces (Q2512884) (← links)
- Algebraic constructions of complete \(m\)-arcs (Q2678450) (← links)
- On complete \(m\)-arcs (Q6066480) (← links)
- Detecting arrays for effects of single factors (Q6086392) (← links)
- On the minimum number of minimal codewords (Q6112238) (← links)
