Separating codes have recently been applied in the construction of collusion secure fingerprinting schemes. They are related to other combinatorial concepts the intersecting codes, superimposed codes, hashing families, and group testing. In this paper we study some good, binary asymptotic construction of such codes