Finding Cliques in Projective Space: A Method for Construction of Cyclic Grassmannian Codes
In general, the construction of subspace codes or, in particular, cyclic Grassmannian codes in some projective space Pq(n) is highly mathematical and requires substantial computational power for the resulting searches.In moen finney this paper, we present a new method for the construction of cyclic Grassmannian codes.To do that was designed and imp