Subspace Codes based on Graph Matchings, Ferrers Diagrams and Pending Blocks
arXiv:1404.6723
Abstract
This paper provides new constructions and lower bounds for subspace codes, using Ferrers diagram rank-metric codes from matchings of the complete graph and pending blocks. We present different constructions for constant dimension codes with minimum injection distance or , where is the constant dimension. Furthermore, we present a construction of new codes from old codes for any minimum distance. Then we construct non-constant dimension codes from these codes. The examples of codes obtained by these constructions are the largest known codes for the given parameters.
Parts of this work were presented at ISIT 2013 in Istanbul, Turkey. To appear in IEEE Transactions on Information Theory