Login
Literature by the same author
plus at Google Scholar
Bibliografische Daten exportieren		  

Constructions and Bounds for Mixed-Dimension Subspace Codes

Title data

Honold, Thomas ; Kiermaier, Michael ; Kurz, Sascha:
Constructions and Bounds for Mixed-Dimension Subspace Codes.
Bayreuth , 2016 . - 35 p.

This is the latest version of this item.

Official URL: Volltext

Project information

Project title:
Project's official title
Project's id
Ganzzahlige Optimierungsmodelle für Subspace Codes und endliche Geometrie
No information
Project financing: Deutsche Forschungsgemeinschaft

Abstract in another language

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

Item Type: Preprint, postprint
Keywords: Subspace code; network coding; partial spread
Subject classification: Mathematics Subject Classification Code: 94B05 05B25 51E20 (51E14 51E22 51E23)
Institutions of the University: Faculties > Faculty of Mathematics, Physics und Computer Science
Faculties > Faculty of Mathematics, Physics und Computer Science > Department of Mathematics
Faculties > Faculty of Mathematics, Physics und Computer Science > Department of Mathematics > Chair Mathematics II (Computer Algebra)
Faculties > Faculty of Mathematics, Physics und Computer Science > Department of Mathematics > Chair Mathematical Economics
Faculties
Result of work at the UBT: Yes
DDC Subjects: 000 Computer Science, information, general works > 004 Computer science
500 Science > 510 Mathematics
Date Deposited: 06 Jul 2016 09:17
Last Modified: 20 Mar 2019 11:19
URI: https://eref.uni-bayreuth.de/id/eprint/33155

Available Versions of this Item