Construction of Large Constant Dimension Codes with a Prescribed Minimum Distance
From MaRDI portal
Publication:5504563
DOI10.1007/978-3-540-89994-5_4zbMATH Open1178.94239arXiv0807.3212OpenAlexW3103260357MaRDI QIDQ5504563FDOQ5504563
Authors: Sascha Kurz, Axel Kohnert 
Publication date: 22 January 2009
Published in: Mathematical Methods in Computer Science (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/0807.3212
Recommendations
Cited In (53)
- Two new constructions of cyclic subspace codes via Sidon spaces
- Large optimal cyclic subspace codes
- Parallel sub-code construction for constant-dimension codes
- On the geometry of balls in the Grassmannian and list decoding of lifted Gabidulin codes
- New constructions of Sidon spaces and large cyclic constant dimension codes
- Asymptotic bounds for the sizes of constant dimension codes and an improved lower bound
- Efficient decoding of interleaved subspace and Gabidulin codes beyond their unique decoding radius using Gröbner bases
- Large constant dimension codes and lexicodes
- A characterization of cyclic subspace codes via subspace polynomials
- Construction of optimal constant-dimension subspace codes
- Binary subspace codes in small ambient spaces
- Abelian non-cyclic orbit codes and multishot subspace codes
- New lower bounds for binary constant-dimension subspace codes
- Bilateral multilevel construction of constant dimension codes
- Flag codes: distance vectors and cardinality bounds
- Constructions of cyclic constant dimension codes
- Constructions of optimal Ferrers diagram rank metric codes
- Bounds for flag codes
- Spread decoding in extension fields
- Constructions of Sidon spaces and cyclic subspace codes
- Several classes of optimal Ferrers diagram rank-metric codes
- Cyclic subspace codes via subspace polynomials
- Combining subspace codes
- Construction of subspace codes through linkage
- New constructions of large cyclic subspace codes and Sidon spaces
- Further constructions of cyclic subspace codes
- Existence of \(q\)-analogs of Steiner systems
- New and updated semidefinite programming bounds for subspace codes
- Title not available (Why is that?)
- The interplay of different metrics for the construction of constant dimension codes
- Linearity and complements in projective space
- Galois geometries and coding theory
- Vector space partitions of GF(2)^8
- Subspace codes from Ferrers diagrams
- Constructions of large cyclic constant dimension codes via Sidon spaces
- Further constructions of large cyclic subspace codes via Sidon spaces
- A complete characterization of irreducible cyclic orbit codes and their Plücker embedding
- Several kinds of large cyclic subspace codes via Sidon spaces
- Orbit codes from forms on vector spaces over a finite field
- New constructions of constant dimension subspace codes with large sizes
- Automorphism groups and isometries for cyclic orbit codes
- Subspace codes in \(\operatorname{PG}(2N-1; q)\)
- Constant dimension codes from Riemann-Roch spaces
- Construction of constant dimension codes in some cases
- Message encoding and retrieval for spread and cyclic orbit codes
- \(q\)-analogs of packing designs
- New constant dimension subspace codes from parallel linkage construction and multilevel construction
- Subspace packings: constructions and bounds
- Cyclic constant dimension subspace codes via the sum of Sidon spaces
- Cyclic orbit codes and stabilizer subfields
- Flag codes of maximum distance and constructions using Singer groups
- Covering of subspaces by subspaces
- Construction of constant dimension codes in some cases
Uses Software
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)
