3,287 research outputs found
Covering Grassmannian Codes: Bounds and Constructions
Grassmannian is the set of all -dimensional subspaces
of the vector space Recently, Etzion and Zhang introduced a
new notion called covering Grassmannian code which can be used in network
coding solutions for generalized combination networks. An
- covering Grassmannian code is a
subset of such that every set of codewords of
spans a subspace of dimension at least in
In this paper, we derive new upper and lower bounds on the
size of covering Grassmannian codes. These bounds improve and extend the
parameter range of known bounds.Comment: 17 page
- …