New Constant Dimension Subspace Codes From Generalized Inserting Construction
Yongfeng Niu, Qin Yue, Daitao Huang
Abstract
A basic problem about a constant dimension subspace code is to find its maximal possible size A <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">q</sub> (n, d, k). Linkage construction and inserting construction are two effective methods to improve lower bounds for constant dimension codes. This letter concentrates on parallel linkage construction by He and direct inserting construction by Lao and generalizes the previous results to obtain new lower bounds of constant dimension codes, such as Aq(12,4,6).
Topics & Concepts
Dimension (graph theory)Constant (computer programming)Subspace topologyCode (set theory)Discrete mathematicsMathematicsCombinatoricsComputer scienceMathematical analysisProgramming languageSet (abstract data type)Cooperative Communication and Network CodingAdvanced Wireless Communication TechnologiesCoding theory and cryptography