Optimal subspace codes in
arXiv:1802.09793
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 .
arXiv:1802.09793
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 .