The Use of Blocking Sets in Galois Geometries and in Related Research Areas

DOI10.1007/978-1-4614-0709-6_15zbMath1250.05031MaRDI QIDQ2917250

Storme, L., Valentina Pepe

Publication date: 28 September 2012

Published in: Buildings, Finite Geometries and Groups (Search for Journal in Brave)

Full work available at URL: https://biblio.ugent.be/publication/2140360

zbMATH Keywords

blocking sets; linear codes and projective geometry; substructures in projective spaces

Mathematics Subject Classification ID

94B05: Linear codes (general theory)

05B25: Combinatorial aspects of finite geometries

51E21: Blocking sets, ovals, (k)-arcs

51E20: Combinatorial structures in finite projective spaces

Related Items

Galois geometries and coding theory

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
• An extension theorem for arcs and linear codes
• On the linearity of higher-dimensional blocking sets
• Characterization results on weighted minihypers and on linear codes meeting the Griesmer bound
• Linear sets in finite projective spaces
• The classification of the smallest nontrivial blocking sets in \(PG(n,2)\)
• On the code generated by the incidence matrix of points and \(k\)-spaces in \(\text{PG}(n,q)\) and its dual
• On small blocking sets and their linearity
• On the code generated by the incidence matrix of points and hyperplanes in \(\text{PG}(n,q)\) and its dual
• Characterization results on arbitrary non-weighted minihypers and on linear codes meeting the Griesmer bound
• Tight sets, weighted \(m\)-covers, weighted \(m\)-ovoids, and minihypers
• A \(t\pmod p\) result on weighted multiple \((n-k)\)-blocking sets in \(\mathrm{PG}(n,q)\)
• An empty interval in the spectrum of small weight codewords in the code from points and \(k\)-spaces of \(\mathrm{PG}(n,q)\)
• Hyperplane coverings and blocking sets
• Blocking sets
• Blocking sets and partial spreads in finite projective spaces
• Blocking sets in Desarguesian affine and projective planes
• On small blocking sets
• On the number of slopes of the graph of a function defined on a finite field
• Small minimal blocking sets in \(\text{PG}(2,q^3)\)
• On the spectrum of minimal blocking sets in \(\text{PG}(2,q)\)
• Results on maximal partial spreads in \(PG(3,p^3)\) and on related minihypers
• Lower bounds for the cardinality of minimal blocking sets in projective spaces
• The number of directions determined by a function over a finite field.
• Small blocking sets in \(PG(2,p^3)\)
• Partial \(t\)-spreads in \(\text{PG}(2t+1,q)\)
• On a particular class of minihypers and its applications. II: Improvements for \(q\) square
• Linear point sets and Rédei type \(k\)-blocking sets in \(\mathrm{PG}(n,q)\)
• The spectrum of minimal blocking sets
• Extendability of linear codes over \(\operatorname {GF}(q)\) with minimum distance \(d\), \(\operatorname {gcd}(d,q)=1\)
• Projective geometric codes
• A geometric characterisation of linear \(k\)-blocking sets
• On a particular class of minihypers and its applications. I: The result for general \(q\)
• An extension theorem for linear codes
• Minimum weight and dimension formulas for some geometric codes
• A proof of the linearity conjecture for \(k\)-blocking sets in PG\((n,p^{3}), \, p\) prime
• Small maximal partial \(t\)-spreads
• Small point sets of PG\((2, q)\) intersecting each \(k\)-space in 1 modulo \(\sqrt q\) points
• Blocking sets and semifields
• A new extension theorem for linear codes
• A non-existence result on Cameron–Liebler line classes
• Lacunary Polynomials, Multiple Blocking Sets and Baer Subplanes
• A broadcast key distribution scheme based on block designs
• On large minimal blocking sets in PG(2,q)
• Translation ovoids of orthogonal polar spaces
• A characterization of multiple (n – k)-blocking sets in projective spaces of square order
• Algebraically punctured cyclic codes
• A characterization of flat spaces in a finite geometry and the uniqueness of the hamming and the MacDonald codes
• Baer subplanes and blocking sets
• A Bound for Error-Correcting Codes
• Blocking Sets in Finite Projective Planes
• On 1-blocking sets in \(PG(n,q), n\geq 3\)
• Small blocking sets in higher dimensions
• On the extendability of linear codes
• Minimal blocking sets in projective spaces of square order