Titlebar

Export bibliographic data
Literature by the same author
plus on the publication server
plus at Google Scholar

 

An improvement of the Johnson bound for subspace codes

Title data

Kiermaier, Michael ; Kurz, Sascha:
An improvement of the Johnson bound for subspace codes.
Bayreuth , 2018 . - 12 p.

This is the latest version of this item.

Official URL: Volltext

Project information

Project title:
Project's official titleProject's id
Integer Linear Programming Models for Subspace Codes and Finite GeometryNo information

Project financing: Deutsche Forschungsgemeinschaft

Abstract in another language

Subspace codes, i.e., subset of a finite-field Grassmannian, are applied in random linear network coding.
Here we give improved upper bounds based on the Johnson bound and a connection to divisible codes, which is presented in a purely geometrical way. This complements a recent approach for upper bounds on the maximum size of partial spreads based on projective q^r-divisible codes.

Further data

Item Type: Preprint, postprint, working paper, discussion paper
Keywords: subspace codes; divisible codes; Johnson bound; network coding
Subject classification: Mathematics Subject Classification Code: 51E23 (05B40)
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: 03 May 2018 06:41
Last Modified: 18 Mar 2019 08:57
URI: https://eref.uni-bayreuth.de/id/eprint/43988

Available Versions of this Item