Title data
Honold, Thomas ; Kiermaier, Michael ; Kurz, Sascha:
Constructions and Bounds for Mixed-Dimension Subspace Codes.
Bayreuth
,
2016
. - 35 S.
This is the latest version of this item.
![]() |
|
||||||||
Download (566kB)
|
Project information
Project title: |
|
||||
---|---|---|---|---|---|
Project financing: |
Deutsche Forschungsgemeinschaft |
Abstract
Codes in finite projective spaces with the so-called subspace distance as metric have been proposed for error control in random linear network coding. The resulting Main Problem of Subspace Coding is to determine the maximum size $A_q(v,d)$ of a code in $PG(v-1,F_q)$ with minimum subspace distance $d$. Here we completely resolve this problem for $d>=v-1$. For $d=v-2$ we present some improved bounds and determine $A_2(7,5)=34$.
Further data
Available Versions of this Item
-
Constructions and Bounds for Mixed-Dimension Subspace Codes. (deposited 22 Dec 2015 10:47)
- Constructions and Bounds for Mixed-Dimension Subspace Codes. (deposited 06 Jul 2016 09:15) [Currently Displayed]