Abstract
<p style='text-indent:20px;'>One of the main problems in subspace coding is to determine the maximal possible size of a constant dimension subspace code with given parameters. In this paper, we introduce a family of new codes, named rank-restricted Ferrers diagram rank-metric codes, to give an improved construction of constant dimension subspace codes. Our method constructs many new CDCs with larger sizes than previously best-known codes.</p>
Full Text
Published Version (
Free)
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call