Covering of subspaces by subspaces
From MaRDI portal
Publication:2248651
Abstract: Lower and upper bounds on the size of a covering of subspaces in the Grassmann graph by subspaces from the Grassmann graph , , are discussed. The problem is of interest from four points of view: coding theory, combinatorial designs, -analogs, and projective geometry. In particular we examine coverings based on lifted maximum rank distance codes, combined with spreads and a recursive construction. New constructions are given for with or . We discuss the density for some of these coverings. Tables for the best known coverings, for and , are presented. We present some questions concerning possible constructions of new coverings of smaller size.
Recommendations
Cites work
- scientific article; zbMATH DE number 3843786 (Why is no real title available?)
- scientific article; zbMATH DE number 51878 (Why is no real title available?)
- scientific article; zbMATH DE number 736291 (Why is no real title available?)
- 2-designs over \(GF(2^ m)\)
- 2-designs over GF(q)
- A Rank-Metric Approach to Error Control in Random Network Coding
- A characteristic property of geometric \(t\)-spreads in finite projective spaces
- A characterization of flat spaces in a finite geometry and the uniqueness of the hamming and the MacDonald codes
- A new family of 2-designs over GF\((q)\) admitting SL\(_m(q^l)\)
- 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
- Codes and Designs Related to Lifted MRD Codes
- Codes and anticodes in the Grassman graph
- Coding for Errors and Erasures in Random Network Coding
- Construction of Large Constant Dimension Codes with a Prescribed Minimum Distance
- Designs and partial geometries over finite fields
- Designs over finite fields
- Error-Correcting Codes in Projective Space
- Error-Correcting Codes in Projective Spaces Via Rank-Metric Codes and Ferrers Diagrams
- Maximum-rank array codes and their application to crisscross error correction
- Normal spreads
- On \(q\)-analogs of Steiner systems and covering designs
- On a class of small 2‐designs over gf(q)
- On coverings
- On parallelisms in finite projective spaces
- On perfect codes and related concepts
- On t-covers in finite projective spaces
- Systematic construction of \(q\)-analogs of \(t\)-\((v,k,\lambda)\)-designs
- The Asymptotic Behavior of Grassmannian Codes
- Theory of codes with maximum rank distance
Cited in
(17)- Subsets and subspaces
- The lifting and classification problems for subspaces of covering spaces
- On \(q\)-covering designs
- Smallest cyclically covering subspaces of \(\mathbb{F}_q^n\), and lower bounds in Isbell's conjecture
- On covering approximation subspaces
- On the Grassmann graph of linear codes
- Antisocial Subcovers of Self-Centered Coverings
- Existence of \(q\)-analogs of Steiner systems
- Subspace coverings with multiplicities
- Almost affinely disjoint subspaces and covering Grassmannian codes
- Galois geometries and coding theory
- Avoiding intersections of given size in finite affine spaces \(\operatorname{AG}(n,2)\)
- A new approach for examining \(q\)-Steiner systems
- scientific article; zbMATH DE number 4087836 (Why is no real title available?)
- A note on \(q\)-covering designs in \(\mathrm{PG}(5,q)\)
- Subspace packings: constructions and bounds
- A subspace covering problem in the n-cube
This page was built for publication: Covering of subspaces by subspaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2248651)
