New Constructions of Subspace Codes Using Subsets of MRD Codes in Several Blocks

DOI10.1109/TIT.2020.2975776zbMATH Open1448.94256arXiv1908.03804OpenAlexW3008718457MaRDI QIDQ5124504FDOQ5124504

Authors: Hao Chen, Xianmang He, Jian Weng, Liqing Xu

Publication date: 29 September 2020

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Abstract: A basic problem for the constant dimension subspace coding is to determine the maximal possible size A_q (n, d, k) of a set of k-dimensional subspaces in Fnq such that the subspace distance satisfies d(U, V )> or =d for any two different subspaces U andV in this set. We present two new constructions of constant dimension subspace codes using subsets of maximal rank-distance (MRD) codes in several blocks. This method is firstly applied to the linkage construction and secondly to arbitrary number of blocks of lifting MRD codes. In these two constructions, subsets of MRD codes with bounded ranks play an essential role. The Delsarte theorem of the rank distribution of MRD codes is an important ingredient to count codewords in our constructed constant dimension subspace codes. We give many new lower bounds for A_q (n, d, k). More than 110 new constant dimension subspace codes better than previously best known codes are constructed.

Full work available at URL: https://arxiv.org/abs/1908.03804

zbMATH Keywords

maximum rank-distance (MRD) codes constant dimension subspace coding

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Bounds on codes (94B65)

Cited In (14)

This page was built for publication: New Constructions of Subspace Codes Using Subsets of MRD Codes in Several Blocks

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