On \(q\)-covering designs
From MaRDI portal
Publication:2294102
DOI10.37236/8718zbMath1433.51005arXiv1904.12270OpenAlexW3005196766MaRDI QIDQ2294102
Publication date: 10 February 2020
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1904.12270
Combinatorial aspects of finite geometries (05B25) Combinatorial structures in finite projective spaces (51E20) General theory of linear incidence geometry and projective geometries (51A05) Combinatorial aspects of packing and covering (05B40)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Blocking subspaces by lines in \(PG(n,q)\)
- Theory of codes with maximum rank distance
- A characteristic property of geometric \(t\)-spreads in finite projective spaces
- On t-covers in finite projective spaces
- Bilinear forms over a finite field, with applications to coding theory
- Blocking \(s\)-dimensional subspaces by lines in \(PG(2s,q)\)
- Blocking sets in projective spaces and polar spaces
- On parallelisms in finite projective spaces
- Covering of subspaces by subspaces
- On \(q\)-analogs of Steiner systems and covering designs
- Teoria di Galois, fibrazioni proiettive e geometrie non desarguesiane
- A Note onq-Covering Designs in PG(5,q)
- EXISTENCE OF -ANALOGS OF STEINER SYSTEMS
- 13. MRD codes: constructions and connections
- Coding for Errors and Erasures in Random Network Coding
- A characterization of flat spaces in a finite geometry and the uniqueness of the hamming and the MacDonald codes
- Maximum-rank array codes and their application to crisscross error correction
This page was built for publication: On \(q\)-covering designs
