Summary: A Sidon set \(S\) is a set of integers where the number of solutions to any integer \(k=k_1+k_2\) with \(k_1,k_2\in S\) is at most \(g=2\). If \(g\geq 3\), the set \(S\) is a generalised Sidon set. We consider the Sidon sets modulo \(n\), where the solutions to addition of elements are considered under a given modulus. In this note, we give a construction of a generalised Sidon set modulo \(n\) from any known Sidon set.