Covering of subspaces by subspaces
From MaRDI portal
Publication:2248651
DOI10.1007/s10623-012-9766-3zbMath1342.51007arXiv1111.4319OpenAlexW2040937622MaRDI QIDQ2248651
Publication date: 27 June 2014
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1111.4319
Steiner systems in finite geometry (51E10) Combinatorial codes (94B25) Combinatorial aspects of packing and covering (05B40)
Related Items (5)
Galois geometries and coding theory ⋮ EXISTENCE OF -ANALOGS OF STEINER SYSTEMS ⋮ A new approach for examining \(q\)-Steiner systems ⋮ On \(q\)-covering designs ⋮ A Note onq-Covering Designs in PG(5,q)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Theory of codes with maximum rank distance
- Designs over finite fields
- Designs and partial geometries over finite fields
- A characteristic property of geometric \(t\)-spreads in finite projective spaces
- 2-designs over \(GF(q)\)
- On t-covers in finite projective spaces
- Bilinear forms over a finite field, with applications to coding theory
- Normal spreads
- A new family of 2-designs over GF\((q)\) admitting SL\(_m(q^l)\)
- Blocking \(s\)-dimensional subspaces by lines in \(PG(2s,q)\)
- Blocking sets in projective spaces and polar spaces
- Codes and anticodes in the Grassman graph
- Systematic construction of \(q\)-analogs of \(t\)-\((v,k,\lambda)\)-designs
- On parallelisms in finite projective spaces
- On \(q\)-analogs of Steiner systems and covering designs
- On coverings
- 2-designs over \(GF(2^ m)\)
- Codes and Designs Related to Lifted MRD Codes
- The Asymptotic Behavior of Grassmannian Codes
- Coding for Errors and Erasures in Random Network Coding
- A Rank-Metric Approach to Error Control in Random Network Coding
- On a class of small 2‐designs over gf(q)
- Error-Correcting Codes in Projective Spaces Via Rank-Metric Codes and Ferrers Diagrams
- Error-Correcting Codes in Projective Space
- Construction of Large Constant Dimension Codes with a Prescribed Minimum Distance
- 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
- On perfect codes and related concepts
This page was built for publication: Covering of subspaces by subspaces