Year: 2017
Type: article
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.
Authors: Michael Kiermaier, Sascha Kurz
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
Funder: Deutsche Forschungsgemeinschaft
Award: G6624215543
OpenAlex ID: W2725253139