Covering of Subspaces by Subspaces
Tuvi Etzion

TL;DR
This paper investigates bounds and constructions for covering subspaces in Grassmann graphs, with applications in coding theory, combinatorics, and geometry, introducing new methods and tables for specific parameters.
Contribution
It provides new bounds, constructions, and tables for covering subspaces in Grassmann graphs, especially for q=2, r=2,3, and discusses open questions.
Findings
Bounds on covering sizes are established.
New constructions for q=2, r=2,3 are presented.
Tables of best known coverings for specific parameters are included.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicsgraph theory and CDMA systems · Coding theory and cryptography · Cooperative Communication and Network Coding
