Constructions and bounds for mixed-dimension subspace codes

DOI10.3934/AMC.2016033zbMATH Open1402.94086arXiv1512.06660OpenAlexW2964001610MaRDI QIDQ326349FDOQ326349

Authors: Thomas Honold, Michael Kiermaier, Sascha Kurz 

Publication date: 12 October 2016

Published in: Advances in Mathematics of Communications (Search for Journal in Brave)

Abstract: Codes in finite projective spaces equipped with the subspace distance have been proposed for error control in random linear network coding. The resulting so-called emph{Main Problem of Subspace Coding} is to determine the maximum size $A_q(v,d)$ of a code in $operatornamePG(v-1,mathbb{F}_q)$ with minimum subspace distance $d$. Here we completely resolve this problem for $dgev-1$. For $d=v-2$ we present some improved bounds and determine $A_q(5,3)=2q^3+2$ (all $q$), $A_2(7,5)=34$. We also provide an exposition of the known determination of $A_q(v,2)$, and a table with exact results and bounds for the numbers $A_2(v,d)$, $vleq7$.

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

Recommendations

• Binary subspace codes in small ambient spaces
• Subspace codes in \(\operatorname{PG}(2N-1; q)\)
• Johnson type bounds for mixed dimension subspace codes
• The interplay of different metrics for the construction of constant dimension codes
• On subspace codes

zbMATH Keywords

network codingGalois geometrypartial spreadsubspace code

Mathematics Subject Classification ID

Combinatorial aspects of finite geometries (05B25) Combinatorial structures in finite projective spaces (51E20) Linear codes (general theory) (94B05) Linear codes and caps in Galois spaces (51E22) Finite partial geometries (general), nets, partial spreads (51E14) Spreads and packing problems in finite geometry (51E23)

Cites Work

• Practical graph isomorphism. II.
• Title not available (Why is that?)
• Bilinear forms over a finite field, with applications to coding theory
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Optimal binary subspace codes of length 6, constant dimension 3 and minimum subspace distance 4
• Coding for Errors and Erasures in Random Network Coding
• A Rank-Metric Approach to Error Control in Random Network Coding
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Error-Correcting Codes in Projective Space
• The classification of the translation planes of order 16. I
• Handbook of finite translation planes
• The translation planes of order twenty-five
• Partial spreads in finite projective spaces and partial designs
• Translation planes of order 27
• The translation planes of order 49
• Two-graphs and skew two-graphs in finite geometries
• Bounds for projective codes from semidefinite programming
• Isometry and automorphisms of constant dimension codes
• The automorphism groups of linear codes and canonical representatives of their semilinear isometry classes
• Algebraic codes for network coding
• On putative \(q\)-analogues of the Fano plane and related combinatorial structures
• Current research topics in Galois geometry
• Codes and Designs Related to Lifted MRD Codes
• \(q\)-analogs of packing designs
• Uniqueness of the Projective Plane of Order Eight
• General Galois Geometries
• Title not available (Why is that?)
• Title not available (Why is that?)
• Communication Over Finite-Field Matrix Channels
• Network error correction. I: Basic concepts and upper bounds
• Network error correction. II: Lower bounds
• Galois geometries and coding theory

Cited In (13)

• Classifying optimal binary subspace codes of length 8, constant dimension 4 and minimum distance 6
• Binary subspace codes in small ambient spaces
• Geometrically uniform \(n\)-shot subspace codes
• A subspace code of size 333 in the setting of a binary \(q\)-analog of the Fano plane
• Efficient encoding for a class of subspace subcodes
• Multicomponent codes with maximum code distance
• New and updated semidefinite programming bounds for subspace codes
• Linearity and complements in projective space
• Subspace code based on flats in affine space over finite fields
• Subspace codes in \(\operatorname{PG}(2N-1; q)\)
• Subspace packings: constructions and bounds
• Johnson type bounds for mixed dimension subspace codes
• Classification of large partial plane spreads in \(\mathrm{PG}(6,2)\) and related combinatorial objects

Uses Software

• Cliquer

This page was built for publication: Constructions and bounds for mixed-dimension subspace codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q326349)