## Title data

Heinlein, Daniel ; Kurz, Sascha:

**Asymptotic Bounds for the Sizes of Constant Dimension Codes and an Improved Lower Bound.**

*In:* Barbero, Ángela I. ; Skachek, Vitaly ; Ytrehus, Øyvind
(ed.):
Coding Theory and Applications : 5th International Castle Meeting, ICMCTA 2017, Vihula, Estonia, August 28-31, 2017, Proceedings. -
Cham
: Springer International Publishing
,
2017
. - pp. 163-191
. - (Lecture Notes in Computer Science
; 10495
)

ISBN 9783319662787

DOI: https://doi.org/10.1007/978-3-319-66278-7_15

## Related URLs

## Project information

Project title: |
Project's official title Project's id Integer Linear Programming Models for Subspace Codes and Finite Geometry No information |
---|---|

Project financing: |
Deutsche Forschungsgemeinschaft |

## Abstract in another language

We study asymptotic lower and upper bounds for the sizes of constant dimension codes with respect to the subspace or injection distance, which is used in random linear network coding. In this context we review known upper bounds and show relations between them. A slightly improved version of the so-called linkage construction is presented which is e.g. used to construct constant dimension codes with subspace distance d=4, dimension k=3 of the codewords for all field sizes q, and sufficiently large dimensions v of the ambient space, that exceed the MRD bound, for codes containing a lifted MRD code, by Etzion and Silberstein.