Subspace code constructions

2019/05/27 by Cossidente, Antonio, Marino, Giuseppe, Pavese, Francesco
#Combinatorics (math.CO) #FOS: Computer and information sciences #FOS: Mathematics #Information Theory (cs.IT)

paper · doi:10.48550/arxiv.1905.11021

Abstract

We improve on the lower bound of the maximum number of planes of \rm PG(8,q) mutually intersecting in at most one point leading to the following lower bound: \cal A_q(9, 4; 3) ≥ q¹²+2q⁸+2q⁷+q⁶+q⁵+q⁴+1 for constant dimension subspace codes. We also construct two new non-equivalent (6, (q³-1)(q²+q+1), 4; 3)_q constant dimension subspace orbit-codes.

Related

• A new upper bound for subspace codes
• Optimal subspace codes in \rm PG(4,q)
• Subspace codes in PG(2n-1,q)
• Tables of subspace codes
• Veronese subspace codes