Binary Subspace Codes in Small Ambient Spaces
Binary Subspace Codes in Small Ambient Spaces
复制标题
DOI：
10.3934/amc.2018048
复制
发表时间：
2018-04
期刊：
影响因子：
--
通讯作者：
Daniel Heinlein;Sascha Kurz
中科院分区：
文献类型：
--
作者：
Daniel Heinlein;Sascha Kurz
Codes in finite projective spaces equipped with the subspace distance have been proposed for error control in random linear network coding. Here we collect the present knowledge on lower and upper bounds for binary subspace codes for projective dimensions of at most $7$. We obtain several improvements of the bounds and perform two classifications of optimal subspace codes, which are unknown so far in the literature.
