Subspace Codes based on Graph Matchings, Ferrers Diagrams and Pending Blocks
Information Theory
2015-05-08 v2 math.IT
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.
Cite
@article{arxiv.1404.6723,
title = {Subspace Codes based on Graph Matchings, Ferrers Diagrams and Pending Blocks},
author = {Natalia Silberstein and Anna-Lena Trautmann},
journal= {arXiv preprint arXiv:1404.6723},
year = {2015}
}
Comments
Parts of this work were presented at ISIT 2013 in Istanbul, Turkey. To appear in IEEE Transactions on Information Theory