Title data
Heinlein, Daniel ; Kurz, Sascha:
Asymptotic bounds for the sizes of constant dimension codes and an improved lower bound.
Bayreuth
,
2017
.  30 p.
Project information
Project title: 



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 socalled 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.
Further data
Item Type:  Preprint, postprint, working paper, discussion paper 

Keywords:  constant dimension codes; subspace distance; injection distance; random network coding 
Subject classification:  Mathematics Subject Classification Code: 51E23 05B40 (11T71 94B25) 
Institutions of the University:  Faculties > Faculty of Mathematics, Physics und Computer Science > Department of Mathematics Faculties > Faculty of Mathematics, Physics und Computer Science > Department of Mathematics > Chair Mathematics in Economy Faculties Faculties > Faculty of Mathematics, Physics und Computer Science 
Result of work at the UBT:  Yes 
DDC Subjects:  000 Computer Science, information, general works > 004 Computer science 500 Science > 510 Mathematics 
Date Deposited:  13 May 2017 21:00 
Last Modified:  18 Mar 2019 15:10 
URI:  https://eref.unibayreuth.de/id/eprint/37118 