An improvement of the Johnson bound for subspace codes
Michael Kiermaier, Sascha Kurz · EPub Bayreuth (University of Bayreuth) · 2017
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.