Subspace codes, i.e., sets of subspaces of $\mathbb{F}_q^v$, 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.
@article{10_37236_8188,
author = {Thomas Honold and Michael Kiermaier and Sascha Kurz},
title = {Johnson type bounds for mixed dimension subspace codes},
journal = {The electronic journal of combinatorics},
year = {2019},
volume = {26},
number = {3},
doi = {10.37236/8188},
zbl = {1446.94208},
url = {http://geodesic.mathdoc.fr/articles/10.37236/8188/}
}
TY - JOUR
AU - Thomas Honold
AU - Michael Kiermaier
AU - Sascha Kurz
TI - Johnson type bounds for mixed dimension subspace codes
JO - The electronic journal of combinatorics
PY - 2019
VL - 26
IS - 3
UR - http://geodesic.mathdoc.fr/articles/10.37236/8188/
DO - 10.37236/8188
ID - 10_37236_8188
ER -
%0 Journal Article
%A Thomas Honold
%A Michael Kiermaier
%A Sascha Kurz
%T Johnson type bounds for mixed dimension subspace codes
%J The electronic journal of combinatorics
%D 2019
%V 26
%N 3
%U http://geodesic.mathdoc.fr/articles/10.37236/8188/
%R 10.37236/8188
%F 10_37236_8188
Thomas Honold; Michael Kiermaier; Sascha Kurz. Johnson type bounds for mixed dimension subspace codes. The electronic journal of combinatorics, Tome 26 (2019) no. 3. doi: 10.37236/8188
