Johnson type bounds for mixed dimension subspace codes

URN to cite this document: urn:nbn:de:bvb:703-epub-4095-4

Title data

Honold, Thomas ; Kiermaier, Michael ; Kurz, Sascha:
Johnson type bounds for mixed dimension subspace codes.
Bayreuth , 2019 . - 16 S.

This is the latest version of this item.

Format:	PDF
Name:	johnson_mdc.pdf
Version:	Published Version
Available under License	Creative Commons BY 4.0: Attribution

Download (212kB)

Abstract

Subspace codes, i.e., sets of subspaces of GF(q)^v, are applied in random linear network coding. Here we give improved upper bounds for their cardinalities based on the Johnson bound for constant dimension codes.

Further data

Item Type:	Preprint, postprint
Keywords:	Galois geometry; network coding; subspace code; partial spread
Subject classification:	Mathematics Subject Classification Code: 05B25 51E20 (51E14 51E23)
DDC Subjects:	000 Computer Science, information, general works > 004 Computer science 500 Science > 510 Mathematics
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 II (Computer Algebra) Faculties > Faculty of Mathematics, Physics und Computer Science > Department of Mathematics > Chair Mathematical Economics Faculties Faculties > Faculty of Mathematics, Physics und Computer Science
Language:	English
Originates at UBT:	Yes
URN:	urn:nbn:de:bvb:703-epub-4095-4
Date Deposited:	17 Jan 2019 09:51
Last Modified:	14 Mar 2019 13:55
URI:	https://epub.uni-bayreuth.de/id/eprint/4095

Available Versions of this Item

Johnson type bounds for mixed dimension subspace codes. (deposited 14 Sep 2018 09:14)
- Johnson type bounds for mixed dimension subspace codes. (deposited 17 Jan 2019 09:51) [Currently Displayed]

Download Statistics

Downloads

Downloads per month over past year