Construction of Large Constant Dimension Codes with a Prescribed Minimum Distance

被引：0

作者：

Kohnert, Axel ^{[1
]}

Kurz, Sascha ^{[1
]}

机构：

[1] Univ Bayreuth, Dept Math, D-95440 Bayreuth, Germany

来源：

MATHEMATICAL METHODS IN COMPUTER SCIENCE | 2008年 / 5393卷

关键词：

network coding; q-analogue of Steiner systems; subspace codes;

D O I：

暂无

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

In this paper we construct constant dimension codes with prescribed minimum distance. There is an increased interest in subspace codes in general since a paper [13] by Kotter and Kschischang where 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 [7] which they used for the construction of designs over finite fields to construct constant dimension codes. Using this approach we found many new constant dimension codes with a larger number of codewords than previously known codes. We finally give a table of the best constant dimension codes we found.

引用

页码：31 / 42

页数：12