Abstract : In this paper we propose an explicit construction of a new class of 3-TA (Traceable Codes) of size (2n-2) and length ( 2n-2), n > 1. By the definition of Traceable code in [3] for a code C being 3-TA , minimum distance d of the code is given by d >(1−1𝑐2 )n, n is the length of the code and c defines the number of colluders. In that paper we have tried to give the answer of the open problem mentioned in [4 ]. Can we design c-TA codes for which
q <𝑐2also ? , q defines the size of field and 𝑐 defines the number of colluders.
Keywords: Traceable (TA) Code, Hamming Code, Latin Square, Combinatorics.
[1]. B. Chor, A. Fiat and M. Naor, "Tracing Traitors" ,Crypto'94 (Lecture Notes in Computer Science),Berlin, Heidelberg ,New York ,vol.839, pp.480-491, 1994.
[2]. D. Boneh and J. Shaw," Collusion secure fingerprinting for Digital Data" in Advances in Cryptology-CRYPTO '95 (Lecture Notes in Computer Science),vol. 963,pp.463-465,New York ,1995.
[3]. D. Boneh and J. Shaw," Collusion secure fingerprinting for Digital Data" IEEE Transactions on Information Theory ,vol.44,pp. 1897-1905,1998.
[4]. D.R. Stinson , R. Wei ,"Combinatorial Properties and Constructions of traceability schemes and frameproof codes" SIAM Journal of Discrete Mathematics, vol.2 ,pp. 41-53,1998.
[5]. D.R. Stinson , T. Van Trung, R. Wei ,"Secure frameproof codes, Key Distribution Patterns and related structures "J. Statistical Planning Inference vol. 86(2),(2000),pp. 595-617.
