2018/08/10 by Honold, Thomas, Kiermaier, Michael, Kurz, Sascha
#05B25 #51E14 #51E20 (Primary) #51E23 (Secondary) #Combinatorics (math.CO) #FOS: Mathematics
paper · doi:10.48550/arxiv.1808.03580
Subspace codes, i.e., sets of subspaces of \mathbbFqv, 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.