In this work we construct an infinite family of quantum synchronizable codes from duadic codes. Further, we show that the quantum synchronizable codes obtained from repeated roots may be a solution to design good codes since it gives more flexibility in constructing the codes and keep the errors rate closely to the same as when using simple roots cyclic codes. We also gives some useful constructions.