Transitive \(\mathrm{PSL}(2,11)\)-invariant \(k\)-arcs in \(\mathrm{PG}(4,q)\)
From MaRDI portal
Publication:1999905
DOI10.1007/S10623-018-0588-9zbMath1417.51007arXiv1804.09707OpenAlexW2963608183WikidataQ128869167 ScholiaQ128869167MaRDI QIDQ1999905
Publication date: 27 June 2019
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1804.09707
Linear algebraic groups over finite fields (20G40) Combinatorial structures in finite projective spaces (51E20)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 42-arcs in \(\mathrm{PG}(2, q)\) left invariant by \(\mathrm{PSL}(2, 7)\)
- Projective \(k\)-arcs and 2-level secret-sharing schemes
- On linear codes admitting large automorphism groups
- Infinite family of large complete arcs in PG\((2, q ^{n })\), with \(q\) odd and \(n > 1\) odd
- Geometrical contributions to secret sharing theory
- Transitive \(A_6\)-invariant \(k\)-arcs in \(\mathrm{PG}(2,q)\)
- Transitive \(\mathrm{PSL}(2,11)\)-invariant \(k\)-arcs in \(\mathrm{PG}(4,q)\)
- Transitive \(\mathrm{PSL}(2,7)\)-invariant 42-arcs in 3-dimensional projective spaces
- The Maximal Subgroups of the Low-Dimensional Finite Classical Groups
- On Small Complete Arcs and Transitive A5-Invariant Arcs in the Projective Plane PG(2,q)
- On the Covering Radius of MDS Codes
- A large automorphism group decreases the number of computations in the construction of an optimal encoder/decoder pair for linear block code
This page was built for publication: Transitive \(\mathrm{PSL}(2,11)\)-invariant \(k\)-arcs in \(\mathrm{PG}(4,q)\)