Some new lower bounds on the minimum distance of cyclic codes of composite length are presented. These bounds generalize some existing bounds and give better estimates of the minimum distance for a wide range of cyclic codes, Lower bounds on the random-error-correction capability of a particular class of cyclic codes of composite length

, where

and

are relatively prime, are easily derived.