Subspace packings: constructions and bounds
From MaRDI portal
Abstract: The Grassmannian is the set of all -dimensional subspaces of the vector space . K"{o}tter and Kschischang showed that codes in Grassmannian space can be used for error-correction in random network coding. On the other hand, these codes are -analogs of codes in the Johnson scheme, i.e., constant dimension codes. These codes of the Grassmannian also form a family of -analogs of block designs and they are called subspace designs. In this paper, we examine one of the last families of -analogs of block designs which was not considered before. This family, called subspace packings, is the -analog of packings, and was considered recently for network coding solution for a family of multicast networks called the generalized combination networks. A subspace packing - is a set of -subspaces from such that each -subspace of is contained in at most elements of . The goal of this work is to consider the largest size of such subspace packings. We derive a sequence of lower and upper bounds on the maximum size of such packings, analyse these bounds, and identify the important problems for further research in this area.
Recommendations
Cites work
- scientific article; zbMATH DE number 3137862 (Why is no real title available?)
- scientific article; zbMATH DE number 3167429 (Why is no real title available?)
- scientific article; zbMATH DE number 3467122 (Why is no real title available?)
- scientific article; zbMATH DE number 1556736 (Why is no real title available?)
- scientific article; zbMATH DE number 6813620 (Why is no real title available?)
- scientific article; zbMATH DE number 2117212 (Why is no real title available?)
- scientific article; zbMATH DE number 7124291 (Why is no real title available?)
- scientific article; zbMATH DE number 3235247 (Why is no real title available?)
- scientific article; zbMATH DE number 3379722 (Why is no real title available?)
- 2-designs over \(GF(2^ m)\)
- 2-designs over \(GF(q)\)
- 2-spreads and transitive and orthogonal 2-parallelisms of \(PG(5, 2)\)
- A Random Linear Network Coding Approach to Multicast
- A new approach for examining \(q\)-Steiner systems
- A new series of large sets of subspace designs over the binary field
- An introduction to divisible codes
- Association schemes and t-designs in regular semilattices
- Asymptotic bounds for the sizes of constant dimension codes and an improved lower bound
- Bilinear forms over a finite field, with applications to coding theory
- Binary subspace codes in small ambient spaces
- Bounds on \((n,r)\)-arcs and their application to linear codes
- Classifying optimal binary subspace codes of length 8, constant dimension 4 and minimum distance 6
- Codes and Designs Related to Lifted MRD Codes
- Coding for Errors and Erasures in Random Network Coding
- Construction of Large Constant Dimension Codes with a Prescribed Minimum Distance
- Construction of subspace codes through linkage
- Constructions and bounds for mixed-dimension subspace codes
- 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
- Existence of \(q\)-analogs of Steiner systems
- Galois geometries and coding theory
- Generalized vector space partitions
- Grassmannian Codes With New Distance Measures for Network Coding
- Johnson type bounds for mixed dimension subspace codes
- Johnson type bounds on constant dimension codes
- Large sets of \(t\)-designs over finite fields
- Large sets of subspace designs
- Leonhard Euler and a 𝑞-analogue of the logarithm
- Line spreads of PG(5, 2)
- Linear network coding
- Locally symmetric designs
- Maximum-rank array codes and their application to crisscross error correction
- Near perfect coverings in graphs and hypergraphs
- Network information flow
- On a class of small 2‐designs over gf(q)
- On a packing and covering problem
- On point-cyclic resolutions of the 2-(63, 7, 15) design associated with PG(5, 2)
- On the Foundations of Combinatorial Theory IV Finite Vector Spaces and Eulerian Generating Functions
- On the Lengths of Divisible Codes
- On the inequalities of \(t\)-designs over a finite field
- Optimal binary subspace codes of length 6, constant dimension 3 and minimum subspace distance 4
- Partial \(k\)-parallelisms in finite projective spaces
- Partial parallelisms in finite projective spaces
- Partial t-spreads and group constructible \((s,r,\mu)\)-nets
- Partitioning the planes of \(AG_{2m}(2)\) into 2-designs
- Projective Geometry over 1 and the Gaussian Binomial Coefficients
- Quotient sets and subset-subspace analogy
- Residual \(q\)-Fano planes and related structures
- Systematic construction of \(q\)-analogs of \(t\)-\((v,k,\lambda)\)-designs
- The Asymptotic Behavior of Grassmannian Codes
- The order of the automorphism group of a binary \(q\)-analog of the Fano plane is at most two
- Theory of codes with maximum rank distance
- Vector Network Coding Based on Subspace Codes Outperforms Scalar Linear Network Coding
- \(q\)-analogs of group divisible designs
- q-analogues of t-designs and their existence
Cited in
(10)- Bounds for codes and designs in complex subspaces
- Bounds for flag codes
- Almost affinely disjoint subspaces and covering Grassmannian codes
- An asymptotically optimal construction of almost affinely disjoint subspaces
- On the geometry of balls in the Grassmannian and list decoding of lifted Gabidulin codes
- Covering of subspaces by subspaces
- AG codes, \(t\)-designs and partition sets
- \(q\)-analogs of packing designs
- Combinatorial constructions of packings in Grassmannian spaces
- Asymptotically optimal \([2k+1,k,k]_q\)-almost affinely disjoint subspaces
This page was built for publication: Subspace packings: constructions and bounds
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2200513)
