Construction of Large Constant Dimension Codes with a Prescribed Minimum Distance
From MaRDI portal
Abstract: In this paper we construct constant dimension space codes with prescribed minimum distance. There is an increased interest in space codes since a paper by Koetter and Kschischang were they gave an application in network coding. There is also a connection to the theory of designs over finite fields. We will modify a method of Braun, Kerber and Laue which they used for the construction of designs over finite fields to do the construction of space codes. Using this approach we found many new constant dimension spaces codes with a larger number of codewords than previously known codes. We will finally give a table of the best found constant dimension space codes.
Recommendations
Cited in
(62)- Efficient decoding of interleaved subspace and Gabidulin codes beyond their unique decoding radius using Gröbner bases
- Binary subspace codes in small ambient spaces
- Constant dimension codes from Riemann-Roch spaces
- Message encoding and retrieval for spread and cyclic orbit codes
- Asymptotic bounds for the sizes of constant dimension codes and an improved lower bound
- Subspace codes in \(\operatorname{PG}(2N-1; q)\)
- Constructions of cyclic constant dimension codes
- Constructions of optimal Ferrers diagram rank metric codes
- Linearity and complements in projective space
- A complete characterization of irreducible cyclic orbit codes and their Plücker embedding
- Further constructions of cyclic subspace codes
- Orbit codes from forms on vector spaces over a finite field
- Flag codes: distance vectors and cardinality bounds
- Parallel sub-code construction for constant-dimension codes
- Flag codes of maximum distance and constructions using Singer groups
- New constant dimension subspace codes from parallel linkage construction and multilevel construction
- Constructions of Sidon spaces and cyclic subspace codes
- Subspace packings: constructions and bounds
- New and updated semidefinite programming bounds for subspace codes
- Abelian non-cyclic orbit codes and multishot subspace codes
- Bounds for flag codes
- Covering of subspaces by subspaces
- Several classes of optimal Ferrers diagram rank-metric codes
- Large constant dimension codes and lexicodes
- Several kinds of large cyclic subspace codes via Sidon spaces
- Cyclic orbit codes and stabilizer subfields
- Cyclic subspace codes via subspace polynomials
- A characterization of cyclic subspace codes via subspace polynomials
- Spread decoding in extension fields
- New constructions of large cyclic subspace codes and Sidon spaces
- Constructions of large cyclic constant dimension codes via Sidon spaces
- Further constructions of large cyclic subspace codes via Sidon spaces
- Cyclic constant dimension subspace codes via the sum of Sidon spaces
- Construction of optimal constant-dimension subspace codes
- Existence of q-analogs of Steiner systems
- q-analogs of packing designs
- Construction of subspace codes through linkage
- scientific article; zbMATH DE number 1189027 (Why is no real title available?)
- On the geometry of balls in the Grassmannian and list decoding of lifted Gabidulin codes
- New lower bounds for binary constant-dimension subspace codes
- Construction of constant dimension codes in some cases
- Construction of constant dimension codes in some cases
- Subspace codes from Ferrers diagrams
- Bilateral multilevel construction of constant dimension codes
- Automorphism groups and isometries for cyclic orbit codes
- The interplay of different metrics for the construction of constant dimension codes
- Combining subspace codes
- Vector space partitions of GF(2)^8
- New constructions of Sidon spaces and large cyclic constant dimension codes
- New constructions of constant dimension subspace codes with large sizes
- Large optimal cyclic subspace codes
- Two new constructions of cyclic subspace codes via Sidon spaces
- Multi-orbit cyclic subspace codes via direct sum of Sidon spaces
- Construction of large cyclic subspace codes with dimension k+1 via Sidon spaces
- New constructions of cyclic subspace codes via variants of Sidon spaces
- Constructions of optimal cyclic subspace codes via Sidon spaces
- Large cyclic subspace codes over finite fields
- New constructions of cyclic constant-dimension subspace codes based on Sidon spaces and subspace polynomials
- Three families of large cyclic subspace codes
- New construction of cyclic subspace codes via Sidon spaces
- Two kinds of optimal multi-orbit cyclic subspace codes via Sidon spaces
- Galois geometries and coding theory
This page was built for publication: Construction of Large Constant Dimension Codes with a Prescribed Minimum Distance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5504563)
