Constructing saturating sets in projective spaces using subgeometries
From MaRDI portal
Publication:2168075
DOI10.1007/s10623-021-00951-yzbMath1496.05016arXiv2008.13459OpenAlexW3210494824MaRDI QIDQ2168075
Publication date: 31 August 2022
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2008.13459
Linear codes (general theory) (94B05) Combinatorial aspects of finite geometries (05B25) Combinatorial structures in finite projective spaces (51E20)
Related Items
On cutting blocking sets and their codes, Small Strong Blocking Sets by Concatenation, Upper bounds on the length function for covering codes with covering radius \(R\) and codimension \(tR+1\), Saturating linear sets of minimal rank
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Higgledy-piggledy subspaces and uniform subspace designs
- Lines in higgledy-piggledy arrangement
- Linear representations of subgeometries
- Linear nonbinary covering codes and saturating sets in projective spaces
- Saturated configurations of points in projective Galois spaces
- Intersections of Baer subgeometries
- On saturating sets in small projective geometries
- New bounds for linear codes of covering radius 2
- Minimal linear codes arising from blocking sets
- New bounds for linear codes of covering radii 2 and 3
- New covering codes of radius \(R\), codimension \(tr\) and \(tr+\frac{R}{2}\), and saturating sets in projective spaces
- Field reduction and linear sets in finite geometry
- Constructions and families of nonbinary linear codes with covering radius 2
- Constructions and families of covering codes and saturated sets of points in projective geometry
- On a combinatorial generalization of 27 lines associated with a cubic surface
