Stinson and Wei [6] have extensively studied the construction of c-frame proof codes using Balanced Incomplete Block Designs (BIBDs), offering a powerful Combinatorial Approach to Digital Fingerprinting and Traitor Tracing. Their work identifies specific combinatorial properties of BIBDs that ensure frameproof properties of BIBDs, thereby preventing coalitions of users from framing innocent parties. In this study, we revisit these constructions and reinterpret the conditions outlined by Stinson and Wei within the framework of traceable codes-specifically, 2-traceable codes and 3-frameproof codes for the higher values of k i.e. block size in case of (v, b, r, k, λ)-BIBD.