Construction of Large Constant Dimension Codes with a Prescribed Minimum Distance
From MaRDI portal
Publication:5504563
DOI10.1007/978-3-540-89994-5_4zbMath1178.94239arXiv0807.3212OpenAlexW3103260357MaRDI QIDQ5504563
Publication date: 22 January 2009
Published in: Mathematical Methods in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0807.3212
Related Items (41)
Flag codes of maximum distance and constructions using Singer groups ⋮ Efficient decoding of interleaved subspace and Gabidulin codes beyond their unique decoding radius using Gröbner bases ⋮ Binary subspace codes in small ambient spaces ⋮ Construction of optimal constant-dimension subspace codes ⋮ New constant dimension subspace codes from parallel linkage construction and multilevel construction ⋮ Constructions of Sidon spaces and cyclic subspace codes ⋮ Construction of subspace codes through linkage ⋮ q-Analogs of Packing Designs ⋮ New constructions of large cyclic subspace codes and Sidon spaces ⋮ Cyclic subspace codes via subspace polynomials ⋮ Linearity and complements in projective space ⋮ On the geometry of balls in the Grassmannian and list decoding of lifted Gabidulin codes ⋮ A complete characterization of irreducible cyclic orbit codes and their Plücker embedding ⋮ Constructions of large cyclic constant dimension codes via Sidon spaces ⋮ A characterization of cyclic subspace codes via subspace polynomials ⋮ Bilateral multilevel construction of constant dimension codes ⋮ Automorphism groups and isometries for cyclic orbit codes ⋮ Combining subspace codes ⋮ Further constructions of large cyclic subspace codes via Sidon spaces ⋮ Vector space partitions of GF(2)^8 ⋮ Message encoding and retrieval for spread and cyclic orbit codes ⋮ New constructions of Sidon spaces and large cyclic constant dimension codes ⋮ Subspace packings: constructions and bounds ⋮ Galois geometries and coding theory ⋮ Spread decoding in extension fields ⋮ EXISTENCE OF -ANALOGS OF STEINER SYSTEMS ⋮ Cyclic constant dimension subspace codes via the sum of Sidon spaces ⋮ New and updated semidefinite programming bounds for subspace codes ⋮ Abelian non-cyclic orbit codes and multishot subspace codes ⋮ New Lower Bounds for Binary Constant-Dimension Subspace Codes ⋮ Bounds for flag codes ⋮ Constructions of cyclic constant dimension codes ⋮ Covering of subspaces by subspaces ⋮ Constructions of optimal Ferrers diagram rank metric codes ⋮ Several classes of optimal Ferrers diagram rank-metric codes ⋮ Further constructions of cyclic subspace codes ⋮ Several kinds of large cyclic subspace codes via Sidon spaces ⋮ Orbit codes from forms on vector spaces over a finite field ⋮ Flag codes: distance vectors and cardinality bounds ⋮ Cyclic orbit codes and stabilizer subfields ⋮ Subspace codes from Ferrers diagrams
Uses Software
This page was built for publication: Construction of Large Constant Dimension Codes with a Prescribed Minimum Distance
