By exploring some geometry of Segre varieties and Veronese varieties, new families of non-linear maximum rank distance codes and optimal constant rank codes are provided.
Non-linear maximum rank distance codes / Cossidente, Antonio; Marino, Giuseppe; Pavese, Francesco. - In: DESIGNS, CODES AND CRYPTOGRAPHY. - ISSN 0925-1022. - 79:3(2016), pp. 597-609. [10.1007/s10623-015-0108-0]
Non-linear maximum rank distance codes
Pavese, Francesco
2016-01-01
Abstract
By exploring some geometry of Segre varieties and Veronese varieties, new families of non-linear maximum rank distance codes and optimal constant rank codes are provided.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
cmp.pdf
accesso aperto
Descrizione: Accepted manuscript
Tipologia:
Documento in Post-print
Licenza:
Tutti i diritti riservati
Dimensione
281.58 kB
Formato
Adobe PDF
|
281.58 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
