Constant dimension codes (CDCs) have received a lot of attention due to their application in random network coding. One main problem with CDCs is to improve the lower bound ofAq(n, d, k)for given parametersn, dandk, whereAq(n, d, k)denotes the maximum size of all(n, M, d, k)qCDCs. The paper aims to construct CDCs by combining the coset and linkage construction. Precisely, we first combine the coset and linkage construction in different ways and then turn our attention to the coset construction. To enlarge the size of CDCs constructed from the coset construction, we are devoted to constructing lists of CDCs with fixed distance having size as large as possible by the cosets of optimal Ferrers diagram rank metric codes and the parallelisms inGq(n, k). As applications, numerous CDCs with larger size than the previously best known codes are obtained, including Aq(18, 6, 9),Aq(14, 6, 7),Aq(12, 4, 6),Aq(10, 4, 5),Aq(14, 4, 7),Aq(16, 4, 8) andAq(n, 4, 4) for 13 ≤n≤ 16.