New Constant Dimension Subspace Codes From the Mixed Dimension Construction

Compressed chaotic signal reconstruction based on deep learning

New constant dimension subspace codes from multilevel linkage construction

<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>

An algorithm for generalized syndrome decoding problem

New upper bounds and constructions of multi-erasure locally recoverable codes

New constant dimension subspace codes from block inserting constructions