Constructions and bounds for mixed-dimension subspace codes

DOI10.3934/amc.2016033zbMath1402.94086arXiv1512.06660OpenAlexW2964001610MaRDI QIDQ326349

Thomas Honold, Sascha Kurz, Michael Kiermaier

Publication date: 12 October 2016

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

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

zbMATH Keywords

subspace codenetwork codingGalois geometrypartial spread

Mathematics Subject Classification ID

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

Related Items (6)

Binary subspace codes in small ambient spaces ⋮ Subspace packings: constructions and bounds ⋮ New and updated semidefinite programming bounds for subspace codes ⋮ Classifying optimal binary subspace codes of length 8, constant dimension 4 and minimum distance 6 ⋮ Classification of large partial plane spreads in \(\mathrm{PG}(6,2)\) and related combinatorial objects ⋮ Johnson type bounds for mixed dimension subspace codes

Uses Software

• Cliquer

Cites Work

• The classification of the translation planes of order 16. I
• Network error correction. I: Basic concepts and upper bounds
• Network error correction. II: Lower bounds
• Galois geometries and coding theory
• The translation planes of order twenty-five
• Partial spreads in finite projective spaces and partial designs
• Bilinear forms over a finite field, with applications to coding theory
• 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
• Practical graph isomorphism. II.
• On Putative q-Analogues of the Fano Plane and Related Combinatorial Structures
• Codes and Designs Related to Lifted MRD Codes
• Optimal binary subspace codes of length 6, constant dimension 3 and minimum subspace distance 4
• q-Analogs of Packing Designs
• Uniqueness of the Projective Plane of Order Eight
• General Galois Geometries
• Coding for Errors and Erasures in Random Network Coding
• A Rank-Metric Approach to Error Control in Random Network Coding
• Communication Over Finite-Field Matrix Channels
• Error-Correcting Codes in Projective Space
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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