Results 1 
2 of
2
Optimal Binary Subspace Codes of Length 6, Constant Dimension 3 and Minimum Subspace Distance 4
"... Abstract. It is shown that the maximum size of a binary subspace code of packet length v = 6, minimum subspace distance d = 4, and constant dimension k = 3 is M = 77; in Finite Geometry terms, the maximum number of planes in PG(5; 2) mutually intersecting in at most a point is 77. Optimal binary ( ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
(Show Context)
Abstract. It is shown that the maximum size of a binary subspace code of packet length v = 6, minimum subspace distance d = 4, and constant dimension k = 3 is M = 77; in Finite Geometry terms, the maximum number of planes in PG(5; 2) mutually intersecting in at most a point is 77. Optimal binary (v;M; d; k) = (6; 77; 4; 3) subspace codes are classied into 5 isomorphism types, and a computerfree construction of one isomorphism type is provided. The construction uses both geometry and nite elds theory and generalizes to any q, yielding a new family of qary (6; q 6