2019/11/04 by Xianmang He, Yindong Chen, He, Xianmang +5
Computer Science · Engineering · #Advanced MIMO Systems Optimization #Advanced Wireless Communication Technologies #Cooperative Communication and Network Coding #FOS: Computer and information sciences #Information Theory (cs.IT)
paper · pdf · doi:10.48550/arxiv.1911.00508
openalex publication_date 2019/11/04 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
One of the most fundamental topics in subspace coding is to explore the maximal possible value \bf Aq(n,d,k) of a set of k-dimensional subspaces in \mathbbFqn such that the subspace distance satisfies dS(U,V) = dim(U+V)-dim(U∩ V) ≥ d for any two different k-dimensional subspaces U and V in this set. In this paper, we propose a construction for constant dimension subspace codes by inserting a composite structure composing of an MRD code and its sub-codes. Its vast advantage over the previous constructions has been confirmed through extensive examples. At least 49 new constant dimension subspace codes which exceeds the currently best codes are constructed.