Guruswami and Xing introduced subspace designs in 2013 to give the first construction of positive rate rank metric codes list-decodable beyond half the distance. In this paper we provide bounds involving the parameters of a subspace design, showing they are tight via explicit constructions. We point out a connection with sum-rank metric codes, dealing with optimal codes and minimal codes with respect to this metric. Applications to two-intersection sets with respect to hyperplanes, two-weight codes, cutting blocking sets and lossless dimension expanders are also provided.
@article{10_4171_emss_77,
author = {Paolo Santonastaso and Ferdinando Zullo},
title = {On subspace designs},
journal = {EMS surveys in mathematical sciences},
pages = {1--62},
year = {2024},
volume = {11},
number = {1},
doi = {10.4171/emss/77},
url = {http://geodesic.mathdoc.fr/articles/10.4171/emss/77/}
}
TY - JOUR
AU - Paolo Santonastaso
AU - Ferdinando Zullo
TI - On subspace designs
JO - EMS surveys in mathematical sciences
PY - 2024
SP - 1
EP - 62
VL - 11
IS - 1
UR - http://geodesic.mathdoc.fr/articles/10.4171/emss/77/
DO - 10.4171/emss/77
ID - 10_4171_emss_77
ER -