On Traceability Property of Linear Codes and Resolvable BIBDS

Anu Kathuria, Sudhir Batra

Abstract: Traceability Codes are Combinatorial Objects introduced by Chor, Fiat and Naor in 1994[7 ] to be used in traitor tracing to protect Digital Content. Frameproof Codes were given by Boneh and Shaw in 1994 to prevent privacy and gave the idea of c-secure codes with ?-error. Traceable Codes is a strong form of Frameproof Codes. Balanced Incomplete Block Design Codes in form of frameproof codes are already available in literature [4]. Here in this paper we define how Equidistant Constant Weight Codes and Different Combinatorial Structures like Resolvable Balanced Incomplete Block Designs are related with each other and then represent the conditions for being these Algebraic Structures to be 2-Traceable Code.

Keywords: Resolvable Balanced Incomplete Block Designs (RBIBD),Latin Squares and Projective Plane