A new upper bound for subspace codes

Abstract: It is shown that the maximum size

A_{2} (8, 6; 4)

of a binary subspace code of packet length

v = 8

, minimum subspace distance

d = 4

, and constant dimension

k = 4

is at most

272

. In Finite Geometry terms, the maximum number of solids in

o p e r a t o r n a m e P G (7, 2)

, mutually intersecting in at most a point, is at most

272

. Previously, the best known upper bound

A_{2} (8, 6; 4) l e 289

was implied by the Johnson bound and the maximum size

A_{2} (7, 6; 3) = 17

of partial plane spreads in

o p e r a t o r n a m e P G (6, 2)

. The result was obtained by combining the classification of subspace codes with parameters

(7, 17, 6; 3)_{2}

and

(7, 34, 5; 3, 4)_{2}

with integer linear programming techniques. The classification of

(7, 33, 5; 3, 4)_{2}

subspace codes is obtained as a byproduct.

This page was built for publication: A new upper bound for subspace codes