Subspace packings: constructions and bounds

DOI10.1007/S10623-020-00732-ZzbMATH Open1453.94164arXiv1909.06081OpenAlexW3101763414MaRDI QIDQ2200513FDOQ2200513

Sascha Kurz, Ferruh Özbudak, Kamil Otal, Tuvi Etzion

Publication date: 22 September 2020

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

Abstract: The Grassmannian $mathcal{G}_q(n,k)$ is the set of all $k$-dimensional subspaces of the vector space $mathbb{F}_q^n$. 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 $q$-analogs of codes in the Johnson scheme, i.e., constant dimension codes. These codes of the Grassmannian $mathcal{G}_q(n,k)$ also form a family of $q$-analogs of block designs and they are called subspace designs. In this paper, we examine one of the last families of $q$-analogs of block designs which was not considered before. This family, called subspace packings, is the $q$-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 $t$-$(n,k,lambda{)}_q$ is a set $mathcalS$ of $k$-subspaces from $mathcal{G}_q(n,k)$ such that each $t$-subspace of $mathcal{G}_q(n,t)$ is contained in at most $lambda$ elements of $mathcalS$. 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.

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

Recommendations

• Subspace codes in \(\operatorname{PG}(2N-1; q)\)
• Covering of subspaces by subspaces
• Bounds for codes and designs in complex subspaces
• Combinatorial constructions of packings in Grassmannian spaces
• Constructions and bounds for mixed-dimension subspace codes

zbMATH Keywords

rank-metric codes\(q\)-analogs of designsgeneralized combination networksGrassmannian codessubspace packingsvector network coding

Mathematics Subject Classification ID

Combinatorial structures in finite projective spaces (51E20) Bounds on codes (94B65) Other types of codes (94B60)

Cites Work

• On a packing and covering problem
• Bilinear forms over a finite field, with applications to coding theory
• Network information flow
• Linear network coding
• Title not available (Why is that?)
• Near perfect coverings in graphs and hypergraphs
• Johnson type bounds on constant dimension codes
• Theory of codes with maximum rank distance
• Designs over finite fields
• Designs and partial geometries over finite fields
• Association schemes and t-designs in regular semilattices
• Large sets of \(t\)-designs over finite fields
• EXISTENCE OF -ANALOGS OF STEINER SYSTEMS
• Optimal binary subspace codes of length 6, constant dimension 3 and minimum subspace distance 4
• A Random Linear Network Coding Approach to Multicast
• Coding for Errors and Erasures 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
• Title not available (Why is that?)
• Maximum-rank array codes and their application to crisscross error correction
• 2-spreads and transitive and orthogonal 2-parallelisms of \(PG(5, 2)\)
• Title not available (Why is that?)
• 2-designs over \(GF(q)\)
• A new series of large sets of subspace designs over the binary field
• Systematic construction of \(q\)-analogs of \(t\)-\((v,k,\lambda)\)-designs
• On the inequalities of \(t\)-designs over a finite field
• 2-designs over \(GF(2^ m)\)
• Large sets of subspace designs
• Partial t-spreads and group constructible \((s,r,\mu)\)-nets
• Partitioning the planes of \(AG_{2m}(2)\) into 2-designs
• Codes and Designs Related to Lifted MRD Codes
• Construction of subspace codes through linkage
• Constructions and bounds for mixed-dimension subspace codes
• Error-Correcting Codes in Projective Spaces Via Rank-Metric Codes and Ferrers Diagrams
• Galois geometries and coding theory
• On the Foundations of Combinatorial Theory IV Finite Vector Spaces and Eulerian Generating Functions
• On point-cyclic resolutions of the 2-(63, 7, 15) design associated with PG(5, 2)
• Title not available (Why is that?)
• Title not available (Why is that?)
• 2. q-analogs of group divisible designs
• Projective Geometry over  1 and the Gaussian Binomial Coefficients
• q-analogues of t-designs and their existence
• Locally symmetric designs
• Quotient sets and subset-subspace analogy
• Title not available (Why is that?)
• Line spreads of PG(5, 2)
• Bounds on \((n,r)\)-arcs and their application to linear codes
• The Asymptotic Behavior of Grassmannian Codes
• An introduction to divisible codes
• On the Lengths of Divisible Codes
• Leonhard Euler and a 𝑞-analogue of the logarithm
• Classifying optimal binary subspace codes of length 8, constant dimension 4 and minimum distance 6
• Title not available (Why is that?)
• Title not available (Why is that?)
• A new approach for examining \(q\)-Steiner systems
• Partial parallelisms in finite projective spaces
• Partial ‐Parallelisms in Finite Projective Spaces
• Generalized vector space partitions
• Asymptotic bounds for the sizes of constant dimension codes and an improved lower bound
• Binary subspace codes in small ambient spaces
• The order of the automorphism group of a binary \(q\)-analog of the Fano plane is at most two
• Johnson type bounds for mixed dimension subspace codes
• Residual \(q\)-Fano planes and related structures
• Vector Network Coding Based on Subspace Codes Outperforms Scalar Linear Network Coding
• Grassmannian Codes With New Distance Measures for Network Coding
• Title not available (Why is that?)

Cited In (3)

• Asymptotically optimal \([2k+1,k,k]_q\)-almost affinely disjoint subspaces
• Bounds for flag codes
• An asymptotically optimal construction of 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)