Multiple Blocking Sets and Arcs in Finite Planes
From MaRDI portal
Publication:4340937
DOI10.1112/JLMS/54.3.581zbMATH Open0904.51002OpenAlexW2009045150MaRDI QIDQ4340937FDOQ4340937
Authors: Simeon Ball
Publication date: 29 December 1998
Published in: Journal of the London Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1112/jlms/54.3.581
Recommendations
Cited In (39)
- Title not available (Why is that?)
- Upper chromatic number of finite projective planes
- Three families of multiple blocking sets in Desarguesian projective planes of even order
- A new upper bound for the largest complete \((k,n)\)-arc in \(\mathrm{PG}(2,q)\)
- Bounds on \((n,r)\)-arcs and their application to linear codes
- On multiple blocking sets in Galois planes
- Characterizations of Hermitian varieties by intersection numbers
- Maximal (\(n\),3)-arcs in PG(2,13)
- On the extendability of quasidivisible Griesmer arcs
- Blocking and double blocking sets in finite planes
- Title not available (Why is that?)
- Search problems in vector spaces
- Title not available (Why is that?)
- The packing problem in statistics, coding theory and finite projective spaces
- Near MDS codes of non-elliptic-curve type from Reed-Solomon codes
- Title not available (Why is that?)
- On a particular class of minihypers and its applications. II: Improvements for \(q\) square
- Improved bounds on \(m_r(2,q)q=19,25,27\)
- Largest minimal blocking sets in PG(2,8)
- Double blocking sets of size \(3 q - 1\) in \(\operatorname{PG}(2, q)\)
- Title not available (Why is that?)
- Near-MDS codes from maximal arcs in \(\mathrm{PG}(2,q)\)
- Four new families of NMDS codes with dimension 4 and their applications
- On the (22, 4)-arcs in PG(2, 7) and related codes
- Three combinatorial perspectives on minimal codes
- Some subsets of points in the plane associated to truncated Reed-Muller codes with good parameters
- The 2-blocking number and the upper chromatic number of \(\operatorname{PG}(2,q)\)
- Multiple blocking sets in finite projective spaces and improvements to the Griesmer bound for linear codes
- New \((n, r)\)-arcs in \(\mathrm{PG}(2, 17)\), \(\mathrm{PG}(2, 19)\), and \(\mathrm{PG}(2, 23)\)
- A characterisation result on a particular class of non-weighted minihypers
- The non-existence of some NMDS codes and the extremal sizes of complete \((n,3)\)-arcs in \(\mathrm{PG}(2,16)\)
- Characterization results on arbitrary non-weighted minihypers and on linear codes meeting the Griesmer bound
- The minimal number of lines intersected by a set of \(q+2\) points, blocking sets, and intersecting circles
- On rich and poor directions determined by a subset of a finite plane
- Arcs, blocking sets, and minihypers
- Minimal multiple blocking sets
- New classes of NMDS codes with dimension 3
- On Cameron--Liebler line classes
- Maximal AMDS codes
This page was built for publication: Multiple Blocking Sets and Arcs in Finite Planes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4340937)