Sidon spaces serve as an important tool for investigating the properties of \({\mathbb F}_q-\) subspace multiplication and have been effectively used to construct large cyclic subspace codes in recent years. In this paper, we establish two distinct constructions of large cyclic subspace code utilizing Sidon spaces. By employing Sidon spaces with dimension \(k+1\) , we obtain several large cyclic subspace codes with optimal minimum distance \(2k\) . Notably, we establish that when \(n=7k\) , the cyclic subspace codes in \(\mathcal{G}_q(7k,k+1)\) have more codewords than previous works. Additionally, let \(n,k,l\) be positive integers satisfying \(kl|n\) and \(\gcd(k,l)=1\) . We explore Sidon spaces of dimension \(k+l\) to discover new cyclic subspace codes in \(\mathcal{G}_q(n,k+l)\) . The parameters for cyclic subspace codes in \(\mathcal{G}_q(n,k+l)\) are new and not covered by previous constructions, particularly when \(5kl\leq n < 7kl\) .
