Constructions of Difference Systems of Sets From Finite Projective Geometry

Difference systems of sets
$(DSS{\rm s})$
are combinatorial structures introduced by Levenshtein in connection with code synchronization. In this paper, some recursive constructions of
$DSS{\rm s}$
obtained from finite projective geometry are presented. As a consequence, new infinite families of optimal
$DSS{\rm s}$
are obtained.