Construction of Large Constant Dimension Codes With a Prescribed Minimum Distance

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.

13 pages, 1 figure, 1 table, submitted

Cited by in corpus (10)

• Cyclic Orbit Codes
• Coset Construction for Subspace Codes
• Partial spreads and vector space partitions
• Asymptotic bounds for the sizes of constant dimension codes and an improved lower bound
• Constructions for optimal Ferrers diagram rank-metric codes
• Bounds for flag codes
• New Lower Bounds for Constant Dimension Codes
• Subspace Packings -- Constructions and Bounds
• A subspace code of size $333$ in the setting of a binary $q$-analog of the Fano plane
• New constructions of cyclic constant-dimension subspace codes based on Sidon spaces and subspace polynomials