The fundamental problem of subspace coding is to explore the maximum possible cardinality \(\varvec{A}_{\varvec{q}}\varvec{(n, d, k)}\) of a set of \(\varvec{k}\) -dimensional subspaces of an \(\varvec{n}\) -dimensional vector space over \(\varvec{\mathbb {F}_q}\) such that the subspace distance satisfies \(\varvec{d}_{\varvec{S}}\varvec{(W_1, W_2) \ge d}\) for any two distinct subspaces \(\varvec{W}_{\varvec{1}}\varvec{,} \varvec{W}_{\varvec{2}}\) in this set. In this paper, we construct a new class of constant dimension codes (CDCs) by generalizing the coset construction and combining it with CDCs derived from parallel linkage construction and coset construction with an aim to improve the new lower bounds of \(\varvec{A}_{\varvec{q}}\varvec{(n, d, k).}\) We found a remarkable improvement in some of the lower bounds of \(\varvec{A}_{\varvec{q}}\varvec{(n, d, k).}\)