A New Approach to the Main Problem of Subspace Coding

Publication date 6 August 2014

Combinatorial aspects of finite geometries (05B25) General block designs in finite geometry (51E05) Combinatorial structures in finite projective spaces (51E20) Spreads and packing problems in finite geometry (51E23) Linear codes (general theory) (94B05)

Abstract: Subspace codes form the appropriate mathematical setting for investigating the Koetter-Kschischang model of fault-tolerant network coding. The Main Problem of Subspace Coding asks for the determination of a subspace code of maximum size (proportional to the transmission rate) if the remaining parameters are kept fixed. We describe a new approach to finding good subspace codes, which surpasses the known size limit of lifted MRD codes and is capable of yielding an alternative construction of the currently best known binary subspace code of packet length 7, constant dimension 3 and minimum subspace distance 4.

This page was built for publication: A New Approach to the Main Problem of Subspace Coding

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6253718)