We improve on the lower bound of the maximum number of planes of PG (8 , q) mutually intersecting in at most one point leading to the following lower bound: Aq(9 , 4 ; 3) ≥ q12+ 2 q8+ 2 q7+ q6+ q5+ q4+ 1. We also construct two new non–equivalent (6,(q3-1)(q2+q+1),4;3)q–constant dimension subspace orbit–codes.
Subspace code constructions / Cossidente, Antonio; Marino, Giuseppe; Pavese, Francesco. - In: RICERCHE DI MATEMATICA. - ISSN 0035-5038. - STAMPA. - (2022). [10.1007/s11587-020-00521-9]
Subspace code constructions
Pavese, Francesco
2022-01-01
Abstract
We improve on the lower bound of the maximum number of planes of PG (8 , q) mutually intersecting in at most one point leading to the following lower bound: Aq(9 , 4 ; 3) ≥ q12+ 2 q8+ 2 q7+ q6+ q5+ q4+ 1. We also construct two new non–equivalent (6,(q3-1)(q2+q+1),4;3)q–constant dimension subspace orbit–codes.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.
