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: A(q) (9, 4; 3) >= q(12) + 2q(8) + 2q(7) + q(6) + q(5) + q(4) + 1. We also construct two new nonequivalent (6, (q(3) - 1)(q(2) + q + 1), 4; 3) q-constant dimension subspace orbit-codes.
Subspace code constructions
Cossidente A.
;Marino G.;Pavese F.
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: A(q) (9, 4; 3) >= q(12) + 2q(8) + 2q(7) + q(6) + q(5) + q(4) + 1. We also construct two new nonequivalent (6, (q(3) - 1)(q(2) + 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.
