Subspace codes are codes whose codewords are equal to subspaces of a finite vector space V(n, q). Since the geometry of the subspaces of a finite vector space V(n, q) is equivalent to the geometry of the subspaces of a projective space PG(n−1,q), problems on subspace codes can be investigated by using geometrical arguments. Here, we illustrate this approach by showing some recent results on subspace codes, obtained via geometrical arguments. We discuss upper bounds on the sizes of subspace codes, by showing the link between the Johnson bound and the size of partial spreads in finite projective spaces. We present geometrical constructions of subspace codes, and we also focus on subspace codes constructed from Maximum Rank Distance (MRD) codes. Here, we also present geometrical links of MRD codes to exterior sets of Segre varieties. Our aim is to motivate researchers on subspace codes to also consider geometrical arguments when investigating problems on subspace codes.

Geometrical Aspects of Subspace Codes / Cossidente, Antonio; Pavese, Francesco; Storme, Leo (SIGNALS AND COMMUNICATION TECHNOLOGY). - In: Network Coding and Subspace Designs / [a cura di] Marcus Greferath, Mario Osvin Pavčević, Natalia Silberstein, María Ángeles Vázquez-Castro. - STAMPA. - Cham, CH : Springer, 2018. - ISBN 978-3-319-70292-6. - pp. 107-129 [10.1007/978-3-319-70293-3_6]

Geometrical Aspects of Subspace Codes

Francesco Pavese;
2018-01-01

Abstract

Subspace codes are codes whose codewords are equal to subspaces of a finite vector space V(n, q). Since the geometry of the subspaces of a finite vector space V(n, q) is equivalent to the geometry of the subspaces of a projective space PG(n−1,q), problems on subspace codes can be investigated by using geometrical arguments. Here, we illustrate this approach by showing some recent results on subspace codes, obtained via geometrical arguments. We discuss upper bounds on the sizes of subspace codes, by showing the link between the Johnson bound and the size of partial spreads in finite projective spaces. We present geometrical constructions of subspace codes, and we also focus on subspace codes constructed from Maximum Rank Distance (MRD) codes. Here, we also present geometrical links of MRD codes to exterior sets of Segre varieties. Our aim is to motivate researchers on subspace codes to also consider geometrical arguments when investigating problems on subspace codes.
2018
Network Coding and Subspace Designs
978-3-319-70292-6
Springer
Geometrical Aspects of Subspace Codes / Cossidente, Antonio; Pavese, Francesco; Storme, Leo (SIGNALS AND COMMUNICATION TECHNOLOGY). - In: Network Coding and Subspace Designs / [a cura di] Marcus Greferath, Mario Osvin Pavčević, Natalia Silberstein, María Ángeles Vázquez-Castro. - STAMPA. - Cham, CH : Springer, 2018. - ISBN 978-3-319-70292-6. - pp. 107-129 [10.1007/978-3-319-70293-3_6]
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11589/122225
Citazioni
  • Scopus 5
  • ???jsp.display-item.citation.isi??? ND
social impact