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).
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
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
