IJPAM: Volume 6, No. 3 (2003)
School of Information Technology and Computer Science
University of Wollongong
NSW 2522, AUSTRALIA
Abstract. is a -ary code of length . A word is called a descendant of a coalition of codewords , , ..., of if at each position , , inherits a symbol from one of its parents, that is . A -secure frameproof code (-SFPC) ensures that any two disjoint coalitions of size at most have no common descendant. Several probabilistic methods prove the existance of codes but there are not many explicit constructions. Indeed, it is an open problem in Staddon et al [#!SSW00!#] to construct explicitly -ary 2-secure frameproof code for arbitrary .
In this paper, we present several explicit constructions
of -ary 2-SFPCs. These constructions are
generalisation of the binary inner code
of the secure code
in Tô et al [#!TSW02!#].
The length of our new code is logarithmically small
compared to its size.
Received: March 13, 2003
AMS Subject Classification: 68R05, 94A60, 05B99
Key Words and Phrases: secure frameproof codes, fingerprinting codes, traceability codes
Source: International Journal of Pure and Applied Mathematics