Abstract
Let C be a constant dimension code whose codewords are k-dimensional subspaces of Fqm. One of the main research problems of constant dimension codes is to calculate the maximum possible cardinality Aq(m,d,k) of the code whose the distance between any two different codewords is at least d. In this paper, we propose a new construction approach of constant dimension codes. The constant dimension codes based on this construction can be inserted into the parallel linkage construction. Moreover, the proposed construction gives new lower bounds of Aq(m,d,k) for m=2k. Some constant dimension codes with larger cardinality than the previously best known codes are given.
Sign-in/Register to access full text options 
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
