Johnson type bounds for mixed dimension subspace codes
Combinatorics
2019-01-17 v3
Abstract
Subspace codes, i.e., sets of subspaces of , are applied in random linear network coding. Here we give improved upper bounds for their cardinalities based on the Johnson bound for constant dimension codes.
Keywords
Cite
@article{arxiv.1808.03580,
title = {Johnson type bounds for mixed dimension subspace codes},
author = {Thomas Honold and Michael Kiermaier and Sascha Kurz},
journal= {arXiv preprint arXiv:1808.03580},
year = {2019}
}
Comments
16 pages, typos corrected