A note on (3,1) and (3,2) separating systems and bound for (3,1) separating system

Abstract

Separating codes have been studied due to their applications to digital finger printing, the state assignments, automata theory and to construct hash functions. In this paper, we study the necessary and sufficient conditions for a code to be a [Formula: see text] and [Formula: see text]-separating systems for q-ary level and also satisfy its intersecting properties. We also construct a bound for [Formula: see text] separating system.