Covering of subspaces by subspaces

DOI10.1007/S10623-012-9766-3zbMATH Open1342.51007arXiv1111.4319OpenAlexW2040937622MaRDI QIDQ2248651FDOQ2248651

Authors: Tuvi Etzion 

Publication date: 27 June 2014

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Abstract: Lower and upper bounds on the size of a covering of subspaces in the Grassmann graph $c{G}_q(n,r)$ by subspaces from the Grassmann graph $c{G}_q(n,k)$, $kgeqr$, are discussed. The problem is of interest from four points of view: coding theory, combinatorial designs, $q$-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 $q=2$ with $r=2$ or $r=3$. We discuss the density for some of these coverings. Tables for the best known coverings, for $q=2$ and $5leqnleq10$, are presented. We present some questions concerning possible constructions of new coverings of smaller size.

Full work available at URL: https://arxiv.org/abs/1111.4319

Recommendations

• Subspace packings: constructions and bounds
• On \(q\)-covering designs
• A subspace covering problem in the \(n\)-cube
• Completely regular codes in Johnson and Grassmann graphs with small covering radii
• Linear nonbinary covering codes and saturating sets in projective spaces

zbMATH Keywords

projective geometry\(q\)-analogspreadscovering designslifted MRD codessubspace transversal design

Mathematics Subject Classification ID

Combinatorial codes (94B25) Combinatorial aspects of packing and covering (05B40) Steiner systems in finite geometry (51E10)

Cites Work

• Normal spreads
• Bilinear forms over a finite field, with applications to coding theory
• Title not available (Why is that?)
• A characterization of flat spaces in a finite geometry and the uniqueness of the hamming and the MacDonald codes
• On t-covers in finite projective spaces
• Title not available (Why is that?)
• Theory of codes with maximum rank distance
• Designs over finite fields
• Designs and partial geometries over finite fields
• On \(q\)-analogs of Steiner systems and covering designs
• 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 Space
• Construction of Large Constant Dimension Codes with a Prescribed Minimum Distance
• Maximum-rank array codes and their application to crisscross error correction
• On perfect codes and related concepts
• 2-designs over \(GF(q)\)
• A new family of 2-designs over GF\((q)\) admitting SL\(_m(q^l)\)
• Systematic construction of \(q\)-analogs of \(t\)-\((v,k,\lambda)\)-designs
• 2-designs over \(GF(2^ m)\)
• Codes and anticodes in the Grassman graph
• Codes and Designs Related to Lifted MRD Codes
• Error-Correcting Codes in Projective Spaces Via Rank-Metric Codes and Ferrers Diagrams
• On parallelisms in finite projective spaces
• On coverings
• Blocking sets in projective spaces and polar spaces
• Title not available (Why is that?)
• The Asymptotic Behavior of Grassmannian Codes
• Blocking \(s\)-dimensional subspaces by lines in \(PG(2s,q)\)
• A characteristic property of geometric \(t\)-spreads in finite projective spaces

Cited In (16)

• 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
• Subspace coverings with multiplicities
• Existence of \(q\)-analogs of Steiner systems
• Almost affinely disjoint subspaces and covering Grassmannian codes
• Avoiding intersections of given size in finite affine spaces \(\operatorname{AG}(n,2)\)
• Galois geometries and coding theory
• A new approach for examining \(q\)-Steiner systems
• Title not available (Why is that?)
• A note on \(q\)-covering designs in \(\mathrm{PG}(5,q)\)
• 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)