Upper bounds on the smallest size of a complete arc in a finite Desarguesian projective plane based on computer search
From MaRDI portal
Publication:265614
DOI10.1007/s00022-015-0277-zzbMath1336.51004OpenAlexW979955056MaRDI QIDQ265614
Stefano Marcugini, Giorgio Faina, Alexander A. Davydov, Fernanda Pambianco, Alexey A. Kreshchuk, Daniele Bartoli
Publication date: 4 April 2016
Published in: Journal of Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00022-015-0277-z
Linear codes (general theory) (94B05) Linear codes and caps in Galois spaces (51E22) Blocking sets, ovals, (k)-arcs (51E21)
Related Items (6)
Upper bounds on the smallest size of a complete arc in a finite Desarguesian projective plane based on computer search ⋮ Saturating sets in projective planes and hypergraph covers ⋮ Upper bounds on the smallest size of a complete cap in $\mathrm{PG}(N,q)$, $N\ge3$, under a certain probabilistic conjecture ⋮ On the smallest size of an almost complete subset of a conic in \(\mathrm{PG}(2, q)\) and extendability of Reed-Solomon codes ⋮ New bounds for linear codes of covering radii 2 and 3 ⋮ Upper bounds on the smallest size of a complete arc in \(\mathrm{PG}(2, {q})\) under a certain probabilistic conjecture
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Upper bounds on the smallest size of a complete arc in a finite Desarguesian projective plane based on computer search
- Linear nonbinary covering codes and saturating sets in projective spaces
- On sizes of complete arcs in \(PG(2,q)\)
- On the completeness of certain plane arcs. II
- Le geometrie di Galois
- New examples of complete k-arcs in PG(2,q)
- Complete arcs in \(PG(2,25)\): The spectrum of the sizes and the classification of the smallest complete arcs
- Small complete caps in Galois affine spaces
- Random constructions and density results
- On sharply transitive sets in \(\mathrm{PG}(2,g)\).
- On sizes of complete caps in projective spaces \(\mathrm{PG}(n, q)\) and arcs in planes \(\mathrm{PG}(2, q)\)
- Small complete arcs in Galois planes
- Note on the order of magnitude of k for complete k-arcs in PG(2,q)
- On the completeness of certain plane arcs
- Saturated configurations of points in projective Galois spaces
- Orbits of arcs in PG\((N,K)\) under projectivities
- On the spectrum of the values \(k\) for which a complete \(k\)-cap in \(PG(n,q)\) exists
- Small complete arcs in \(PG(2,p)\)
- The packing problem in statistics, coding theory and finite projective spaces
- On small complete arcs in a finite plane
- On small dense arcs in Galois planes of square order
- On saturating sets in projective spaces.
- Small complete arcs in projective planes
- On some 10-arcs for deriving the minimum order for complete arcs in small projective planes
- A small complete arc in \(\text{PG}(2,q)\), \(q=p^2\), \(p\equiv 3\pmod 4\)
- Small minimal blocking sets and complete \(k\)-arcs in PG\((2,p^3)\)
- Small complete caps in PG\((2,q)\), for \(q\) an odd square
- Computer search for small complete caps
- Small almost complete arcs
- Problems and algorithms for covering arrays
- Complete caps in projective spaces PG\((n,q)\)
- Transitive \(A_6\)-invariant \(k\)-arcs in \(\mathrm{PG}(2,q)\)
- New upper bounds on the smallest size of a complete arc in a finite Desarguesian projective plane
- Linear codes over finite fields and finite projective geometries
- New types of estimates for the smallest size of complete arcs in a finite Desarguesian projective plane
- Upper bounds on the smallest size of a complete arc in \(\mathrm{PG}(2, {q})\) under a certain probabilistic conjecture
- On the minimum size of complete arcs and minimal saturating sets in projective planes
- Open problems in finite projective spaces
- On the construction of linear \(q\)-ary lexicodes.
- Computer search in projective planes for the sizes of complete arcs
- On defining sets for projective planes
- The geometry of covering codes: small complete caps and saturating sets in Galois spaces
- On Small Complete Arcs and Transitive A5-Invariant Arcs in the Projective Plane PG(2,q)
- On greedy algorithms in coding theory
- New Quantum Caps in PG(4, 4)
- New inductive constructions of complete caps inPG(N, q),qeven
- Small complete caps in PG(N, q), q even
- Types of superregular matrices and the number of n‐arcs and complete n‐arcs in PG (r, q)
This page was built for publication: Upper bounds on the smallest size of a complete arc in a finite Desarguesian projective plane based on computer search
