Construction of Const Dimension Code from Two Parallel Versions of Linkage Construction
share
According the report [10], the lower bound with the highest score is the improved linkage construction, and it produce currently the best known lower bound about 69.1% of the constant dimension code. We show how to improve the linkage construction of subspace codes by two parallel versions of linkage construction. This proof allow us to attain codes of larger size for a given minimum distance.
READ FULL TEXT