Optimal subspace codes in ${\rm PG}(4,q)$
Combinatorics
2018-02-28 v1 Information Theory
math.IT
Abstract
We investigate subspace codes whose codewords are subspaces of having non-constant dimension. In particular, examples of optimal mixed-dimension subspace codes are provided, showing that .
Keywords
Cite
@article{arxiv.1802.09793,
title = {Optimal subspace codes in ${\rm PG}(4,q)$},
author = {Antonio Cossidente and Francesco Pavese and Leo Storme},
journal= {arXiv preprint arXiv:1802.09793},
year = {2018}
}