An improvement of the Johnson bound for subspace codes

Titelangaben

Kiermaier, Michael ; Kurz, Sascha:
An improvement of the Johnson bound for subspace codes.
Bayreuth , 2017 . - 9 S.

Volltext

	Format: PDF Name: upper_bounds_cdc_arxiv.pdf Version: Veröffentlichte Version Verfügbar mit der Lizenz Creative Commons BY 4.0: Namensnennung
	Download (160kB)

Abstract

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.